./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/rm-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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/rm-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 90737e7de37f377d29635b0f8c6eb5502f274919cfcd178c0f93945dfec4ae40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:54:31,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:54:31,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:54:31,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:54:31,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:54:31,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:54:31,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:54:31,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:54:31,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:54:31,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:54:31,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:54:31,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:54:31,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:54:31,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:54:31,838 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:54:31,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:54:31,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:54:31,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:54:31,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:54:31,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:54:31,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:54:31,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:54:31,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:54:31,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:54:31,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:54:31,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:54:31,841 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 -> 90737e7de37f377d29635b0f8c6eb5502f274919cfcd178c0f93945dfec4ae40 [2025-03-09 05:54:32,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:54:32,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:54:32,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:54:32,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:54:32,033 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:54:32,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/rm-2.i [2025-03-09 05:54:33,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4cefb51/c02e0aad0f754ebead1fac4a5ef40b95/FLAG1564baa89 [2025-03-09 05:54:33,507 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:54:33,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/rm-2.i [2025-03-09 05:54:33,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4cefb51/c02e0aad0f754ebead1fac4a5ef40b95/FLAG1564baa89 [2025-03-09 05:54:33,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4cefb51/c02e0aad0f754ebead1fac4a5ef40b95 [2025-03-09 05:54:33,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:54:33,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:54:33,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:54:33,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:54:33,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:54:33,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:54:33" (1/1) ... [2025-03-09 05:54:33,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2646df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:33, skipping insertion in model container [2025-03-09 05:54:33,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:54:33" (1/1) ... [2025-03-09 05:54:33,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:54:34,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:54:34,654 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:54:34,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:54:34,907 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:54:34,913 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:54:34,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34 WrapperNode [2025-03-09 05:54:34,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:54:34,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:54:34,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:54:34,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:54:34,918 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:54:34" (1/1) ... [2025-03-09 05:54:34,966 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:54:34" (1/1) ... [2025-03-09 05:54:35,055 INFO L138 Inliner]: procedures = 665, calls = 1116, calls flagged for inlining = 33, calls inlined = 32, statements flattened = 2806 [2025-03-09 05:54:35,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:54:35,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:54:35,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:54:35,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:54:35,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,091 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:54:35,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:54:35,202 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:54:35,202 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:54:35,202 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:54:35,203 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (1/1) ... [2025-03-09 05:54:35,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:54:35,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:35,232 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:54:35,237 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:54:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure last_char_is [2025-03-09 05:54:35,257 INFO L138 BoogieDeclarations]: Found implementation of procedure last_char_is [2025-03-09 05:54:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-09 05:54:35,257 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-09 05:54:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:54:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:54:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:54:35,257 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:54:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:54:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:54:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ask_confirmation [2025-03-09 05:54:35,257 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ask_confirmation [2025-03-09 05:54:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:54:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:54:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:54:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:54:35,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:54:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:54:35,258 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:54:35,258 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 05:54:35,259 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 05:54:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:54:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:54:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure remove_file [2025-03-09 05:54:35,259 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_file [2025-03-09 05:54:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure access [2025-03-09 05:54:35,259 INFO L138 BoogieDeclarations]: Found implementation of procedure access [2025-03-09 05:54:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-09 05:54:35,259 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-09 05:54:35,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:54:35,259 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-09 05:54:35,260 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-03-09 05:54:35,260 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure isatty [2025-03-09 05:54:35,260 INFO L138 BoogieDeclarations]: Found implementation of procedure isatty [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 05:54:35,260 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:54:35,260 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-09 05:54:35,260 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-09 05:54:35,636 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:54:35,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:54:35,716 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3564: havoc #t~nondet287; [2025-03-09 05:54:36,126 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: havoc ~dp~0#1.base, ~dp~0#1.offset, ~d~0#1.base, ~d~0#1.offset, ~status~0#1, ~return_value_closedir$8~0#1, ~return_value_rmdir$10~0#1; [2025-03-09 05:54:36,126 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3656: havoc lstat_#t~ret332#1; [2025-03-09 05:54:36,126 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-03-09 05:54:36,126 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443: havoc xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-03-09 05:54:36,126 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3652: havoc stat_#t~ret331#1; [2025-03-09 05:54:37,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-09 05:54:37,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713: havoc getopt_long_#t~ret364#1; [2025-03-09 05:54:37,952 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2025-03-09 05:54:37,952 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:54:38,001 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:54:38,006 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:54:38,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:38 BoogieIcfgContainer [2025-03-09 05:54:38,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:54:38,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:54:38,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:54:38,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:54:38,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:54:33" (1/3) ... [2025-03-09 05:54:38,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2c947f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:54:38, skipping insertion in model container [2025-03-09 05:54:38,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:34" (2/3) ... [2025-03-09 05:54:38,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2c947f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:54:38, skipping insertion in model container [2025-03-09 05:54:38,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:38" (3/3) ... [2025-03-09 05:54:38,014 INFO L128 eAbstractionObserver]: Analyzing ICFG rm-2.i [2025-03-09 05:54:38,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:54:38,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rm-2.i that has 16 procedures, 716 locations, 1 initial locations, 34 loop locations, and 70 error locations. [2025-03-09 05:54:38,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:54:38,098 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;@75872db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:54:38,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-09 05:54:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 716 states, 580 states have (on average 1.6189655172413793) internal successors, (939), 656 states have internal predecessors, (939), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-09 05:54:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:54:38,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:38,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:54:38,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:38,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash 37370751, now seen corresponding path program 1 times [2025-03-09 05:54:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:38,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724076182] [2025-03-09 05:54:38,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:38,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:54:38,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:54:38,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:38,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:38,822 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:54:38,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:38,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724076182] [2025-03-09 05:54:38,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724076182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:38,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:38,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:38,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780690473] [2025-03-09 05:54:38,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:38,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:38,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:38,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:38,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:38,869 INFO L87 Difference]: Start difference. First operand has 716 states, 580 states have (on average 1.6189655172413793) internal successors, (939), 656 states have internal predecessors, (939), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) 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:54:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:39,071 INFO L93 Difference]: Finished difference Result 1322 states and 1972 transitions. [2025-03-09 05:54:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:39,073 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:54:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:39,085 INFO L225 Difference]: With dead ends: 1322 [2025-03-09 05:54:39,086 INFO L226 Difference]: Without dead ends: 607 [2025-03-09 05:54:39,094 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:54:39,096 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 1 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:39,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1651 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-09 05:54:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-03-09 05:54:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 506 states have (on average 1.5454545454545454) internal successors, (782), 556 states have internal predecessors, (782), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 865 transitions. [2025-03-09 05:54:39,169 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 865 transitions. Word has length 4 [2025-03-09 05:54:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:39,169 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 865 transitions. [2025-03-09 05:54:39,169 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:54:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 865 transitions. [2025-03-09 05:54:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:54:39,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:39,169 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:54:39,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:54:39,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 916653467, now seen corresponding path program 1 times [2025-03-09 05:54:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251041671] [2025-03-09 05:54:39,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:39,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:54:39,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:54:39,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:39,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:39,532 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:54:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251041671] [2025-03-09 05:54:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251041671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609309267] [2025-03-09 05:54:39,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:39,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:39,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:39,535 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:54:39,537 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:54:39,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:54:40,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:54:40,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:40,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:40,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:40,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:40,048 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:54:40,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:40,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609309267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:40,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:54:40,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474603006] [2025-03-09 05:54:40,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:40,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:54:40,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:40,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:54:40,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:40,052 INFO L87 Difference]: Start difference. First operand 607 states and 865 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:54:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:40,172 INFO L93 Difference]: Finished difference Result 607 states and 865 transitions. [2025-03-09 05:54:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:54:40,173 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:54:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:40,176 INFO L225 Difference]: With dead ends: 607 [2025-03-09 05:54:40,177 INFO L226 Difference]: Without dead ends: 606 [2025-03-09 05:54:40,177 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:54:40,178 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 1 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:40,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2461 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-09 05:54:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2025-03-09 05:54:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 506 states have (on average 1.5434782608695652) internal successors, (781), 555 states have internal predecessors, (781), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 864 transitions. [2025-03-09 05:54:40,200 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 864 transitions. Word has length 7 [2025-03-09 05:54:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:40,200 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 864 transitions. [2025-03-09 05:54:40,200 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:54:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 864 transitions. [2025-03-09 05:54:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:54:40,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:40,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:54:40,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:54:40,405 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:54:40,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:40,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1648512447, now seen corresponding path program 1 times [2025-03-09 05:54:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:40,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886733365] [2025-03-09 05:54:40,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:40,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:54:40,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:54:40,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:40,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:40,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:54:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886733365] [2025-03-09 05:54:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886733365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:40,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:40,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391395040] [2025-03-09 05:54:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:40,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:40,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:40,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:40,689 INFO L87 Difference]: Start difference. First operand 606 states and 864 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:54:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:40,765 INFO L93 Difference]: Finished difference Result 606 states and 864 transitions. [2025-03-09 05:54:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:40,765 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:54:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:40,768 INFO L225 Difference]: With dead ends: 606 [2025-03-09 05:54:40,768 INFO L226 Difference]: Without dead ends: 605 [2025-03-09 05:54:40,768 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:54:40,768 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 0 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1642 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:54:40,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1642 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-09 05:54:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2025-03-09 05:54:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 504 states have (on average 1.5436507936507937) internal successors, (778), 552 states have internal predecessors, (778), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 861 transitions. [2025-03-09 05:54:40,790 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 861 transitions. Word has length 8 [2025-03-09 05:54:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:40,790 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 861 transitions. [2025-03-09 05:54:40,790 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:54:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 861 transitions. [2025-03-09 05:54:40,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:54:40,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:40,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:40,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:54:40,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:40,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1000058079, now seen corresponding path program 1 times [2025-03-09 05:54:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:40,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899553832] [2025-03-09 05:54:40,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:40,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:54:40,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:54:40,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:40,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:41,106 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:54:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899553832] [2025-03-09 05:54:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899553832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194949129] [2025-03-09 05:54:41,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:41,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:41,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:41,109 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:54:41,111 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:54:41,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:54:41,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:54:41,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:41,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:41,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:54:41,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:41,590 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:54:41,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194949129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:41,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:41,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:54:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463505816] [2025-03-09 05:54:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:41,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:41,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:41,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:41,592 INFO L87 Difference]: Start difference. First operand 603 states and 861 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:54:41,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:41,665 INFO L93 Difference]: Finished difference Result 603 states and 861 transitions. [2025-03-09 05:54:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:41,665 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:54:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:41,671 INFO L225 Difference]: With dead ends: 603 [2025-03-09 05:54:41,671 INFO L226 Difference]: Without dead ends: 601 [2025-03-09 05:54:41,672 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:54:41,672 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 529 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:41,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1117 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-09 05:54:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-09 05:54:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 504 states have (on average 1.5396825396825398) internal successors, (776), 550 states have internal predecessors, (776), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 859 transitions. [2025-03-09 05:54:41,686 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 859 transitions. Word has length 12 [2025-03-09 05:54:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:41,687 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 859 transitions. [2025-03-09 05:54:41,687 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:54:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 859 transitions. [2025-03-09 05:54:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:54:41,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:41,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:41,696 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:54:41,888 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:54:41,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:41,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash -937028235, now seen corresponding path program 1 times [2025-03-09 05:54:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:41,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700193029] [2025-03-09 05:54:41,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:41,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:42,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:54:42,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:54:42,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:42,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:42,144 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:54:42,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:42,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700193029] [2025-03-09 05:54:42,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700193029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:42,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713954630] [2025-03-09 05:54:42,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:42,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:42,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:42,147 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:54:42,148 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:54:42,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:54:42,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:54:42,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:42,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:42,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:42,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:42,610 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:54:42,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:42,643 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:54:42,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713954630] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:42,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:42,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:54:42,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109833509] [2025-03-09 05:54:42,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:42,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:42,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:42,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:42,644 INFO L87 Difference]: Start difference. First operand 601 states and 859 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:54:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:42,767 INFO L93 Difference]: Finished difference Result 1205 states and 1723 transitions. [2025-03-09 05:54:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:42,767 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:54:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:42,770 INFO L225 Difference]: With dead ends: 1205 [2025-03-09 05:54:42,770 INFO L226 Difference]: Without dead ends: 610 [2025-03-09 05:54:42,771 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:54:42,772 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 4 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:42,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3274 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-09 05:54:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2025-03-09 05:54:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 513 states have (on average 1.530214424951267) internal successors, (785), 559 states have internal predecessors, (785), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 868 transitions. [2025-03-09 05:54:42,791 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 868 transitions. Word has length 13 [2025-03-09 05:54:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:42,792 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 868 transitions. [2025-03-09 05:54:42,792 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:54:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 868 transitions. [2025-03-09 05:54:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:54:42,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:42,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:42,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 05:54:42,993 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:54:42,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:42,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:42,994 INFO L85 PathProgramCache]: Analyzing trace with hash 965059929, now seen corresponding path program 2 times [2025-03-09 05:54:42,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:42,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573491487] [2025-03-09 05:54:42,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:43,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:54:43,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:54:43,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:54:43,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:43,427 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:54:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:43,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573491487] [2025-03-09 05:54:43,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573491487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:43,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:43,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:54:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250649059] [2025-03-09 05:54:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:54:43,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:43,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:54:43,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:43,429 INFO L87 Difference]: Start difference. First operand 610 states and 868 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:54:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:43,604 INFO L93 Difference]: Finished difference Result 610 states and 868 transitions. [2025-03-09 05:54:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:54:43,605 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:54:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:43,608 INFO L225 Difference]: With dead ends: 610 [2025-03-09 05:54:43,608 INFO L226 Difference]: Without dead ends: 608 [2025-03-09 05:54:43,609 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:54:43,610 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 528 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:43,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2680 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-09 05:54:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2025-03-09 05:54:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 513 states have (on average 1.5263157894736843) internal successors, (783), 557 states have internal predecessors, (783), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 866 transitions. [2025-03-09 05:54:43,630 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 866 transitions. Word has length 22 [2025-03-09 05:54:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:43,630 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 866 transitions. [2025-03-09 05:54:43,630 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:54:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 866 transitions. [2025-03-09 05:54:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:54:43,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:43,631 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:54:43,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:54:43,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:43,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1508899992, now seen corresponding path program 1 times [2025-03-09 05:54:43,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:43,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345194619] [2025-03-09 05:54:43,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:43,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:54:43,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:54:43,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:43,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:43,906 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:54:43,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345194619] [2025-03-09 05:54:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345194619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:43,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:43,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:54:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883839999] [2025-03-09 05:54:43,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:43,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:43,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:43,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:43,908 INFO L87 Difference]: Start difference. First operand 608 states and 866 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:54:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:43,990 INFO L93 Difference]: Finished difference Result 1199 states and 1716 transitions. [2025-03-09 05:54:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:43,991 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:54:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:43,993 INFO L225 Difference]: With dead ends: 1199 [2025-03-09 05:54:43,994 INFO L226 Difference]: Without dead ends: 611 [2025-03-09 05:54:43,995 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:54:43,995 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 2 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:43,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1631 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-09 05:54:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2025-03-09 05:54:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 516 states have (on average 1.5232558139534884) internal successors, (786), 560 states have internal predecessors, (786), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 869 transitions. [2025-03-09 05:54:44,014 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 869 transitions. Word has length 27 [2025-03-09 05:54:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:44,015 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 869 transitions. [2025-03-09 05:54:44,015 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:54:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 869 transitions. [2025-03-09 05:54:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 05:54:44,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:44,016 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:44,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:54:44,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:44,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash -469074029, now seen corresponding path program 1 times [2025-03-09 05:54:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103145515] [2025-03-09 05:54:44,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:44,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:54:44,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:54:44,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:44,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:44,296 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:54:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103145515] [2025-03-09 05:54:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103145515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:44,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:44,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:44,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045135308] [2025-03-09 05:54:44,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:44,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:44,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:44,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:44,298 INFO L87 Difference]: Start difference. First operand 611 states and 869 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:54:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:44,399 INFO L93 Difference]: Finished difference Result 909 states and 1308 transitions. [2025-03-09 05:54:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:44,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 28 [2025-03-09 05:54:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:44,403 INFO L225 Difference]: With dead ends: 909 [2025-03-09 05:54:44,404 INFO L226 Difference]: Without dead ends: 907 [2025-03-09 05:54:44,404 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:54:44,405 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 411 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:44,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1618 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-03-09 05:54:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 615. [2025-03-09 05:54:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 520 states have (on average 1.521153846153846) internal successors, (791), 564 states have internal predecessors, (791), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 874 transitions. [2025-03-09 05:54:44,426 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 874 transitions. Word has length 28 [2025-03-09 05:54:44,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:44,426 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 874 transitions. [2025-03-09 05:54:44,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:54:44,426 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 874 transitions. [2025-03-09 05:54:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:54:44,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:44,427 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:54:44,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:54:44,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash 517832338, now seen corresponding path program 1 times [2025-03-09 05:54:44,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:44,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725171543] [2025-03-09 05:54:44,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:44,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:44,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:44,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:44,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:44,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:44,690 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:54:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725171543] [2025-03-09 05:54:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725171543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:44,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834590123] [2025-03-09 05:54:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:44,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:44,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:44,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:44,692 INFO L87 Difference]: Start difference. First operand 615 states and 874 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:54:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:44,775 INFO L93 Difference]: Finished difference Result 628 states and 889 transitions. [2025-03-09 05:54:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:44,776 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:54:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:44,779 INFO L225 Difference]: With dead ends: 628 [2025-03-09 05:54:44,780 INFO L226 Difference]: Without dead ends: 626 [2025-03-09 05:54:44,780 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:54:44,781 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 3 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:44,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1628 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-09 05:54:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2025-03-09 05:54:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 529 states have (on average 1.5198487712665407) internal successors, (804), 573 states have internal predecessors, (804), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 887 transitions. [2025-03-09 05:54:44,801 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 887 transitions. Word has length 30 [2025-03-09 05:54:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:44,802 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 887 transitions. [2025-03-09 05:54:44,802 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:54:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 887 transitions. [2025-03-09 05:54:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:54:44,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:44,804 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:54:44,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:54:44,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash 517832498, now seen corresponding path program 1 times [2025-03-09 05:54:44,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:44,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239165790] [2025-03-09 05:54:44,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:44,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:44,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:44,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:44,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:44,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:45,076 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:54:45,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239165790] [2025-03-09 05:54:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239165790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669679148] [2025-03-09 05:54:45,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:45,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:45,078 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:54:45,080 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:54:45,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:45,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:45,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:45,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:45,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1938 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:54:45,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:45,613 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:54:45,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:45,687 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:54:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669679148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:45,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:54:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724540346] [2025-03-09 05:54:45,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:45,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:54:45,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:45,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:54:45,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:45,690 INFO L87 Difference]: Start difference. First operand 624 states and 887 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:54:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:45,911 INFO L93 Difference]: Finished difference Result 1250 states and 1782 transitions. [2025-03-09 05:54:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:54:45,912 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:54:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:45,915 INFO L225 Difference]: With dead ends: 1250 [2025-03-09 05:54:45,915 INFO L226 Difference]: Without dead ends: 641 [2025-03-09 05:54:45,916 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:54:45,916 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 5 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4862 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:45,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4862 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:54:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-03-09 05:54:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-03-09 05:54:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 547 states have (on average 1.4990859232175502) internal successors, (820), 590 states have internal predecessors, (820), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 903 transitions. [2025-03-09 05:54:45,933 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 903 transitions. Word has length 30 [2025-03-09 05:54:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:45,934 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 903 transitions. [2025-03-09 05:54:45,934 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:54:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 903 transitions. [2025-03-09 05:54:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:54:45,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:45,934 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:54:45,947 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:54:46,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:46,136 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:46,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:46,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1968499706, now seen corresponding path program 1 times [2025-03-09 05:54:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:46,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876613954] [2025-03-09 05:54:46,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:46,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:46,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:54:46,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:54:46,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:46,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:46,420 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:54:46,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:46,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876613954] [2025-03-09 05:54:46,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876613954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:46,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:46,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:46,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114236848] [2025-03-09 05:54:46,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:46,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:46,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:46,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:46,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:46,422 INFO L87 Difference]: Start difference. First operand 641 states and 903 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:54:46,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:46,500 INFO L93 Difference]: Finished difference Result 641 states and 903 transitions. [2025-03-09 05:54:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:46,500 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:54:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:46,503 INFO L225 Difference]: With dead ends: 641 [2025-03-09 05:54:46,503 INFO L226 Difference]: Without dead ends: 640 [2025-03-09 05:54:46,503 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:54:46,503 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:46,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1629 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-09 05:54:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2025-03-09 05:54:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 543 states have (on average 1.4990791896869244) internal successors, (814), 585 states have internal predecessors, (814), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 897 transitions. [2025-03-09 05:54:46,521 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 897 transitions. Word has length 49 [2025-03-09 05:54:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:46,522 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 897 transitions. [2025-03-09 05:54:46,522 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:54:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 897 transitions. [2025-03-09 05:54:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:54:46,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:46,523 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] [2025-03-09 05:54:46,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:54:46,523 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:46,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash 782584855, now seen corresponding path program 1 times [2025-03-09 05:54:46,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:46,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68183307] [2025-03-09 05:54:46,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:46,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:54:46,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:54:46,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:46,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:46,801 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:54:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68183307] [2025-03-09 05:54:46,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68183307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439873641] [2025-03-09 05:54:46,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:46,804 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:54:46,806 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:54:47,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:54:47,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:54:47,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:47,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:47,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:47,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:47,382 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:54:47,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:47,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439873641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:47,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:47,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:54:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056185260] [2025-03-09 05:54:47,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:47,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:54:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:47,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:54:47,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:47,384 INFO L87 Difference]: Start difference. First operand 636 states and 897 transitions. Second operand has 4 states, 3 states have (on average 7.0) 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:54:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:47,532 INFO L93 Difference]: Finished difference Result 932 states and 1335 transitions. [2025-03-09 05:54:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:54:47,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) 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:54:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:47,537 INFO L225 Difference]: With dead ends: 932 [2025-03-09 05:54:47,537 INFO L226 Difference]: Without dead ends: 931 [2025-03-09 05:54:47,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:54:47,538 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 821 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:47,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 2445 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-09 05:54:47,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 635. [2025-03-09 05:54:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 543 states have (on average 1.4972375690607735) internal successors, (813), 584 states have internal predecessors, (813), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 896 transitions. [2025-03-09 05:54:47,554 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 896 transitions. Word has length 50 [2025-03-09 05:54:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:47,555 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 896 transitions. [2025-03-09 05:54:47,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) 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:54:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 896 transitions. [2025-03-09 05:54:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 05:54:47,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:47,558 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:47,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 05:54:47,758 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,SelfDestructingSolverStorable11 [2025-03-09 05:54:47,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:47,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1509672153, now seen corresponding path program 1 times [2025-03-09 05:54:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071782732] [2025-03-09 05:54:47,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:47,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:54:47,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:54:47,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:47,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:54:48,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:48,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071782732] [2025-03-09 05:54:48,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071782732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:48,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164723457] [2025-03-09 05:54:48,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:48,018 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:54:48,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 05:54:48,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:54:48,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:54:48,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:48,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:48,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:48,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:54:48,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:54:48,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164723457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:48,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:48,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:54:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866507259] [2025-03-09 05:54:48,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:48,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:48,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:48,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:48,583 INFO L87 Difference]: Start difference. First operand 635 states and 896 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:48,909 INFO L93 Difference]: Finished difference Result 1816 states and 2642 transitions. [2025-03-09 05:54:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 05:54:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:48,916 INFO L225 Difference]: With dead ends: 1816 [2025-03-09 05:54:48,917 INFO L226 Difference]: Without dead ends: 1815 [2025-03-09 05:54:48,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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:54:48,918 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 1760 mSDsluCounter, 4575 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 5385 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:48,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1792 Valid, 5385 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:54:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-03-09 05:54:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 647. [2025-03-09 05:54:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 555 states have (on average 1.491891891891892) internal successors, (828), 596 states have internal predecessors, (828), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 911 transitions. [2025-03-09 05:54:48,943 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 911 transitions. Word has length 51 [2025-03-09 05:54:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:48,943 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 911 transitions. [2025-03-09 05:54:48,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 911 transitions. [2025-03-09 05:54:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:54:48,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:48,944 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:54:48,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 05:54:49,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:49,145 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 119955216, now seen corresponding path program 1 times [2025-03-09 05:54:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553538341] [2025-03-09 05:54:49,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:49,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:54:49,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:54:49,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:49,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:49,422 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:54:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553538341] [2025-03-09 05:54:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553538341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239287748] [2025-03-09 05:54:49,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:49,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:49,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:49,425 INFO L229 MonitoredProcess]: Starting monitored process 8 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:54:49,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 05:54:49,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:54:49,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:54:49,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:49,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:49,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:49,945 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:54:49,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:49,962 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:54:49,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239287748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:49,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:49,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:54:49,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039509460] [2025-03-09 05:54:49,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:49,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:49,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:49,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:49,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:49,963 INFO L87 Difference]: Start difference. First operand 647 states and 911 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:50,108 INFO L93 Difference]: Finished difference Result 1269 states and 1799 transitions. [2025-03-09 05:54:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:50,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 05:54:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:50,111 INFO L225 Difference]: With dead ends: 1269 [2025-03-09 05:54:50,111 INFO L226 Difference]: Without dead ends: 665 [2025-03-09 05:54:50,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:50,112 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 4 mSDsluCounter, 4060 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4875 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:50,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4875 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-09 05:54:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2025-03-09 05:54:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 573 states have (on average 1.4764397905759161) internal successors, (846), 614 states have internal predecessors, (846), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-09 05:54:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 929 transitions. [2025-03-09 05:54:50,127 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 929 transitions. Word has length 55 [2025-03-09 05:54:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:50,127 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 929 transitions. [2025-03-09 05:54:50,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 929 transitions. [2025-03-09 05:54:50,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 05:54:50,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:50,128 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:50,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 05:54:50,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:50,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:50,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2048245099, now seen corresponding path program 1 times [2025-03-09 05:54:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:50,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406730365] [2025-03-09 05:54:50,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:50,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 05:54:50,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 05:54:50,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:50,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:50,666 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:54:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406730365] [2025-03-09 05:54:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406730365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:50,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498929236] [2025-03-09 05:54:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:50,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:50,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:50,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:50,668 INFO L87 Difference]: Start difference. First operand 665 states and 929 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:54:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:50,833 INFO L93 Difference]: Finished difference Result 1325 states and 1884 transitions. [2025-03-09 05:54:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-09 05:54:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:50,837 INFO L225 Difference]: With dead ends: 1325 [2025-03-09 05:54:50,838 INFO L226 Difference]: Without dead ends: 760 [2025-03-09 05:54:50,839 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:54:50,840 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 119 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:50,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1554 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-09 05:54:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 707. [2025-03-09 05:54:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 614 states have (on average 1.4690553745928339) internal successors, (902), 655 states have internal predecessors, (902), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:54:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 987 transitions. [2025-03-09 05:54:50,867 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 987 transitions. Word has length 60 [2025-03-09 05:54:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:50,867 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 987 transitions. [2025-03-09 05:54:50,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:54:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 987 transitions. [2025-03-09 05:54:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 05:54:50,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:50,868 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:50,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 05:54:50,868 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:50,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1268553577, now seen corresponding path program 1 times [2025-03-09 05:54:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:50,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885808198] [2025-03-09 05:54:50,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:50,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:50,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:54:50,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:54:50,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:50,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:51,093 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:54:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885808198] [2025-03-09 05:54:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885808198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:51,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551058881] [2025-03-09 05:54:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:51,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:51,094 INFO L87 Difference]: Start difference. First operand 707 states and 987 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:54:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:51,166 INFO L93 Difference]: Finished difference Result 709 states and 987 transitions. [2025-03-09 05:54:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-03-09 05:54:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:51,170 INFO L225 Difference]: With dead ends: 709 [2025-03-09 05:54:51,170 INFO L226 Difference]: Without dead ends: 707 [2025-03-09 05:54:51,170 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:54:51,170 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 1 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:51,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1627 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-09 05:54:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-09 05:54:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 614 states have (on average 1.4657980456026058) internal successors, (900), 655 states have internal predecessors, (900), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:54:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 985 transitions. [2025-03-09 05:54:51,190 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 985 transitions. Word has length 62 [2025-03-09 05:54:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:51,190 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 985 transitions. [2025-03-09 05:54:51,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:54:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 985 transitions. [2025-03-09 05:54:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:54:51,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:51,191 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:51,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 05:54:51,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:51,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:51,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1887571557, now seen corresponding path program 2 times [2025-03-09 05:54:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:51,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834479678] [2025-03-09 05:54:51,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:51,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-09 05:54:51,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-03-09 05:54:51,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:54:51,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-09 05:54:51,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:51,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834479678] [2025-03-09 05:54:51,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834479678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:51,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:51,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:54:51,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006206993] [2025-03-09 05:54:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:51,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:54:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:51,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:54:51,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:51,573 INFO L87 Difference]: Start difference. First operand 707 states and 985 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:54:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:51,790 INFO L93 Difference]: Finished difference Result 1342 states and 1892 transitions. [2025-03-09 05:54:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:51,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 63 [2025-03-09 05:54:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:51,793 INFO L225 Difference]: With dead ends: 1342 [2025-03-09 05:54:51,793 INFO L226 Difference]: Without dead ends: 707 [2025-03-09 05:54:51,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:51,794 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 529 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:51,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 3444 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:54:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-09 05:54:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-09 05:54:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 614 states have (on average 1.4641693811074918) internal successors, (899), 655 states have internal predecessors, (899), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:54:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 984 transitions. [2025-03-09 05:54:51,809 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 984 transitions. Word has length 63 [2025-03-09 05:54:51,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:51,809 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 984 transitions. [2025-03-09 05:54:51,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:54:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 984 transitions. [2025-03-09 05:54:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 05:54:51,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:51,810 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:51,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 05:54:51,810 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:54:51,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash -20872224, now seen corresponding path program 2 times [2025-03-09 05:54:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:51,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495265766] [2025-03-09 05:54:51,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:51,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:51,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:54:52,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:54:52,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:54:52,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-09 05:54:52,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:52,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495265766] [2025-03-09 05:54:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495265766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:52,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652649449] [2025-03-09 05:54:52,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:52,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:52,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:52,189 INFO L229 MonitoredProcess]: Starting monitored process 9 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:54:52,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 05:54:52,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:55:01,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:55:01,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:55:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:01,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 2245 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:55:01,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:55:01,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:55:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652649449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:01,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:55:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859659503] [2025-03-09 05:55:01,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:01,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:55:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:01,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:55:01,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:55:01,757 INFO L87 Difference]: Start difference. First operand 707 states and 984 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:55:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:02,144 INFO L93 Difference]: Finished difference Result 1397 states and 1961 transitions. [2025-03-09 05:55:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 05:55:02,145 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-03-09 05:55:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:02,148 INFO L225 Difference]: With dead ends: 1397 [2025-03-09 05:55:02,149 INFO L226 Difference]: Without dead ends: 742 [2025-03-09 05:55:02,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 05:55:02,151 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 9 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:02,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4038 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:55:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-09 05:55:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-03-09 05:55:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 650 states have (on average 1.436923076923077) internal successors, (934), 690 states have internal predecessors, (934), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:55:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1019 transitions. [2025-03-09 05:55:02,169 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1019 transitions. Word has length 73 [2025-03-09 05:55:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:02,169 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1019 transitions. [2025-03-09 05:55:02,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:55:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1019 transitions. [2025-03-09 05:55:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 05:55:02,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:02,171 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:02,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 05:55:02,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 05:55:02,372 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:02,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash 39704611, now seen corresponding path program 1 times [2025-03-09 05:55:02,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:02,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489924247] [2025-03-09 05:55:02,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:02,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:02,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:55:02,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:55:02,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:02,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:02,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:02,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489924247] [2025-03-09 05:55:02,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489924247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:02,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208475590] [2025-03-09 05:55:02,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:02,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:02,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:02,773 INFO L229 MonitoredProcess]: Starting monitored process 10 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:55:02,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 05:55:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:55:03,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:55:03,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:03,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:03,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 2366 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:55:03,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:03,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208475590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:03,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:03,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 05:55:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813349461] [2025-03-09 05:55:03,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:03,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:55:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:03,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:55:03,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:55:03,588 INFO L87 Difference]: Start difference. First operand 742 states and 1019 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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:55:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:04,194 INFO L93 Difference]: Finished difference Result 4107 states and 5935 transitions. [2025-03-09 05:55:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:55:04,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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 97 [2025-03-09 05:55:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:04,207 INFO L225 Difference]: With dead ends: 4107 [2025-03-09 05:55:04,208 INFO L226 Difference]: Without dead ends: 4106 [2025-03-09 05:55:04,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:55:04,211 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 6058 mSDsluCounter, 6784 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6138 SdHoareTripleChecker+Valid, 7593 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:04,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6138 Valid, 7593 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:55:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2025-03-09 05:55:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 766. [2025-03-09 05:55:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 674 states have (on average 1.4302670623145401) internal successors, (964), 714 states have internal predecessors, (964), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:55:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1049 transitions. [2025-03-09 05:55:04,259 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1049 transitions. Word has length 97 [2025-03-09 05:55:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:04,259 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1049 transitions. [2025-03-09 05:55:04,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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:55:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1049 transitions. [2025-03-09 05:55:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:55:04,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:04,260 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:04,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 05:55:04,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:04,465 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:04,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 108423962, now seen corresponding path program 1 times [2025-03-09 05:55:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147236446] [2025-03-09 05:55:04,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:04,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:04,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:55:04,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:55:04,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:04,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:04,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:04,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147236446] [2025-03-09 05:55:04,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147236446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:04,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:04,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:04,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642121517] [2025-03-09 05:55:04,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:04,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:04,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:04,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:04,750 INFO L87 Difference]: Start difference. First operand 766 states and 1049 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:04,911 INFO L93 Difference]: Finished difference Result 1327 states and 1875 transitions. [2025-03-09 05:55:04,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:04,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-09 05:55:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:04,915 INFO L225 Difference]: With dead ends: 1327 [2025-03-09 05:55:04,915 INFO L226 Difference]: Without dead ends: 818 [2025-03-09 05:55:04,917 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:55:04,919 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 74 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:04,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1630 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-09 05:55:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 769. [2025-03-09 05:55:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 679 states have (on average 1.4256259204712813) internal successors, (968), 717 states have internal predecessors, (968), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:55:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1053 transitions. [2025-03-09 05:55:04,953 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1053 transitions. Word has length 102 [2025-03-09 05:55:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:04,953 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1053 transitions. [2025-03-09 05:55:04,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1053 transitions. [2025-03-09 05:55:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:55:04,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:04,955 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:04,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 05:55:04,955 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:04,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash 112700637, now seen corresponding path program 1 times [2025-03-09 05:55:04,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:04,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542374325] [2025-03-09 05:55:04,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:04,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:05,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:55:05,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:55:05,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:05,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:05,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542374325] [2025-03-09 05:55:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542374325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:05,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:05,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815107692] [2025-03-09 05:55:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:05,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:05,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:05,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:05,346 INFO L87 Difference]: Start difference. First operand 769 states and 1053 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:05,526 INFO L93 Difference]: Finished difference Result 822 states and 1132 transitions. [2025-03-09 05:55:05,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:05,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-09 05:55:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:05,531 INFO L225 Difference]: With dead ends: 822 [2025-03-09 05:55:05,531 INFO L226 Difference]: Without dead ends: 819 [2025-03-09 05:55:05,536 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:55:05,537 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 188 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:05,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1423 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-09 05:55:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 766. [2025-03-09 05:55:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 679 states have (on average 1.4212076583210604) internal successors, (965), 714 states have internal predecessors, (965), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:55:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1050 transitions. [2025-03-09 05:55:05,565 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1050 transitions. Word has length 102 [2025-03-09 05:55:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:05,565 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1050 transitions. [2025-03-09 05:55:05,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1050 transitions. [2025-03-09 05:55:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:55:05,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:05,568 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:05,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 05:55:05,568 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:05,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash -933823618, now seen corresponding path program 1 times [2025-03-09 05:55:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:05,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089389703] [2025-03-09 05:55:05,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:05,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:55:05,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:55:05,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:05,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089389703] [2025-03-09 05:55:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089389703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:05,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:05,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:05,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022415925] [2025-03-09 05:55:05,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:05,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:05,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:05,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:05,840 INFO L87 Difference]: Start difference. First operand 766 states and 1050 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:05,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:05,969 INFO L93 Difference]: Finished difference Result 1329 states and 1877 transitions. [2025-03-09 05:55:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:05,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-09 05:55:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:05,972 INFO L225 Difference]: With dead ends: 1329 [2025-03-09 05:55:05,973 INFO L226 Difference]: Without dead ends: 816 [2025-03-09 05:55:05,974 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:55:05,975 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 156 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:05,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1521 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-09 05:55:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 751. [2025-03-09 05:55:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 668 states have (on average 1.4146706586826348) internal successors, (945), 699 states have internal predecessors, (945), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:55:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1030 transitions. [2025-03-09 05:55:05,997 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1030 transitions. Word has length 103 [2025-03-09 05:55:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:05,997 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1030 transitions. [2025-03-09 05:55:05,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1030 transitions. [2025-03-09 05:55:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:55:05,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:05,998 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:05,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 05:55:05,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:05,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -801246654, now seen corresponding path program 1 times [2025-03-09 05:55:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504551912] [2025-03-09 05:55:05,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:06,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:55:06,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:55:06,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:06,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:06,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504551912] [2025-03-09 05:55:06,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504551912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:06,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:06,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:06,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022002521] [2025-03-09 05:55:06,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:06,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:06,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:06,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:06,293 INFO L87 Difference]: Start difference. First operand 751 states and 1030 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:06,410 INFO L93 Difference]: Finished difference Result 804 states and 1109 transitions. [2025-03-09 05:55:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-09 05:55:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:06,414 INFO L225 Difference]: With dead ends: 804 [2025-03-09 05:55:06,414 INFO L226 Difference]: Without dead ends: 803 [2025-03-09 05:55:06,415 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:55:06,415 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 186 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:06,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1455 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-09 05:55:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 750. [2025-03-09 05:55:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 668 states have (on average 1.4131736526946108) internal successors, (944), 698 states have internal predecessors, (944), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:55:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1029 transitions. [2025-03-09 05:55:06,458 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1029 transitions. Word has length 103 [2025-03-09 05:55:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:06,458 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1029 transitions. [2025-03-09 05:55:06,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1029 transitions. [2025-03-09 05:55:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 05:55:06,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:06,462 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:06,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 05:55:06,462 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:06,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash -357586416, now seen corresponding path program 1 times [2025-03-09 05:55:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050691739] [2025-03-09 05:55:06,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:06,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 05:55:06,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 05:55:06,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:06,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:06,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050691739] [2025-03-09 05:55:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050691739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983998462] [2025-03-09 05:55:06,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:06,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:06,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:06,808 INFO L229 MonitoredProcess]: Starting monitored process 11 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:55:06,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 05:55:07,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 05:55:07,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 05:55:07,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:07,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:07,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:55:07,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:55:07,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:07,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983998462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:07,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:55:07,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-09 05:55:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137784133] [2025-03-09 05:55:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:07,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:55:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:07,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:55:07,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:55:07,651 INFO L87 Difference]: Start difference. First operand 750 states and 1029 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:55:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:07,834 INFO L93 Difference]: Finished difference Result 1428 states and 2013 transitions. [2025-03-09 05:55:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:55:07,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-03-09 05:55:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:07,838 INFO L225 Difference]: With dead ends: 1428 [2025-03-09 05:55:07,838 INFO L226 Difference]: Without dead ends: 865 [2025-03-09 05:55:07,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:55:07,840 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 326 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:07,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1923 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:55:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-09 05:55:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 749. [2025-03-09 05:55:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 669 states have (on average 1.406576980568012) internal successors, (941), 697 states have internal predecessors, (941), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:55:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1026 transitions. [2025-03-09 05:55:07,872 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1026 transitions. Word has length 105 [2025-03-09 05:55:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:07,872 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1026 transitions. [2025-03-09 05:55:07,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:55:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1026 transitions. [2025-03-09 05:55:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 05:55:07,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:07,874 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:07,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 05:55:08,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 05:55:08,082 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:08,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1336929739, now seen corresponding path program 1 times [2025-03-09 05:55:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390364828] [2025-03-09 05:55:08,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:08,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 05:55:08,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 05:55:08,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:08,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-09 05:55:08,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:08,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390364828] [2025-03-09 05:55:08,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390364828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:08,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:08,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:08,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407019933] [2025-03-09 05:55:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:08,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:08,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:08,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:08,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:08,302 INFO L87 Difference]: Start difference. First operand 749 states and 1026 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:08,372 INFO L93 Difference]: Finished difference Result 749 states and 1026 transitions. [2025-03-09 05:55:08,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:08,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-03-09 05:55:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:08,375 INFO L225 Difference]: With dead ends: 749 [2025-03-09 05:55:08,375 INFO L226 Difference]: Without dead ends: 748 [2025-03-09 05:55:08,375 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:55:08,375 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 1 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:08,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1601 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-09 05:55:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2025-03-09 05:55:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 669 states have (on average 1.4050822122571) internal successors, (940), 696 states have internal predecessors, (940), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:55:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1025 transitions. [2025-03-09 05:55:08,392 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1025 transitions. Word has length 108 [2025-03-09 05:55:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:08,392 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1025 transitions. [2025-03-09 05:55:08,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1025 transitions. [2025-03-09 05:55:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 05:55:08,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:08,393 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:08,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 05:55:08,394 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:08,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1504852141, now seen corresponding path program 1 times [2025-03-09 05:55:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360788075] [2025-03-09 05:55:08,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:08,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 05:55:08,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 05:55:08,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:08,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-09 05:55:12,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360788075] [2025-03-09 05:55:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360788075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400879754] [2025-03-09 05:55:12,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:12,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:12,673 INFO L229 MonitoredProcess]: Starting monitored process 12 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:55:12,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 05:55:13,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 05:55:14,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 05:55:14,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:14,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:14,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:55:14,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:14,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400879754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:14,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:55:14,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2025-03-09 05:55:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389182492] [2025-03-09 05:55:14,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:14,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:55:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:14,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:55:14,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-09 05:55:14,307 INFO L87 Difference]: Start difference. First operand 748 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:14,403 INFO L93 Difference]: Finished difference Result 1345 states and 1886 transitions. [2025-03-09 05:55:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:55:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-03-09 05:55:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:14,408 INFO L225 Difference]: With dead ends: 1345 [2025-03-09 05:55:14,408 INFO L226 Difference]: Without dead ends: 751 [2025-03-09 05:55:14,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-09 05:55:14,409 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 0 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:14,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2396 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-09 05:55:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2025-03-09 05:55:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 671 states have (on average 1.405365126676602) internal successors, (943), 699 states have internal predecessors, (943), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-09 05:55:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1031 transitions. [2025-03-09 05:55:14,430 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1031 transitions. Word has length 109 [2025-03-09 05:55:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:14,430 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1031 transitions. [2025-03-09 05:55:14,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:55:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1031 transitions. [2025-03-09 05:55:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:55:14,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:14,432 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:14,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 05:55:14,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 05:55:14,633 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:14,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash 18253479, now seen corresponding path program 1 times [2025-03-09 05:55:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:14,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737268527] [2025-03-09 05:55:14,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:14,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:55:14,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:55:14,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:14,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-09 05:55:19,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737268527] [2025-03-09 05:55:19,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737268527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:19,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473330793] [2025-03-09 05:55:19,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:19,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:19,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:19,050 INFO L229 MonitoredProcess]: Starting monitored process 13 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:55:19,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 05:55:19,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:55:19,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:55:19,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:19,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:19,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 05:55:19,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:19,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473330793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:20,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5] total 22 [2025-03-09 05:55:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839368656] [2025-03-09 05:55:20,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 05:55:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:20,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 05:55:20,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-09 05:55:20,001 INFO L87 Difference]: Start difference. First operand 751 states and 1031 transitions. Second operand has 22 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 05:55:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:27,012 INFO L93 Difference]: Finished difference Result 1842 states and 2628 transitions. [2025-03-09 05:55:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 05:55:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 110 [2025-03-09 05:55:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:27,017 INFO L225 Difference]: With dead ends: 1842 [2025-03-09 05:55:27,017 INFO L226 Difference]: Without dead ends: 1245 [2025-03-09 05:55:27,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1757, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 05:55:27,020 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 3117 mSDsluCounter, 6629 mSDsCounter, 0 mSdLazyCounter, 2966 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 7301 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:27,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3126 Valid, 7301 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2966 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-03-09 05:55:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-03-09 05:55:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 767. [2025-03-09 05:55:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 684 states have (on average 1.4035087719298245) internal successors, (960), 711 states have internal predecessors, (960), 46 states have call successors, (46), 18 states have call predecessors, (46), 17 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2025-03-09 05:55:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1049 transitions. [2025-03-09 05:55:27,051 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1049 transitions. Word has length 110 [2025-03-09 05:55:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:27,051 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1049 transitions. [2025-03-09 05:55:27,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 05:55:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1049 transitions. [2025-03-09 05:55:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:55:27,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:27,053 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:27,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 05:55:27,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 05:55:27,253 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:27,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2082757639, now seen corresponding path program 1 times [2025-03-09 05:55:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:27,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195931229] [2025-03-09 05:55:27,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:27,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:27,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:55:27,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:55:27,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:27,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:55:27,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195931229] [2025-03-09 05:55:27,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195931229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548797152] [2025-03-09 05:55:27,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:27,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:27,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:27,541 INFO L229 MonitoredProcess]: Starting monitored process 14 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:55:27,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 05:55:28,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:55:28,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:55:28,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:28,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:28,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 2522 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:55:28,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:55:28,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:55:28,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548797152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:28,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:28,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:55:28,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504650460] [2025-03-09 05:55:28,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:28,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:55:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:28,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:55:28,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:55:28,431 INFO L87 Difference]: Start difference. First operand 767 states and 1049 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:55:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:28,553 INFO L93 Difference]: Finished difference Result 870 states and 1160 transitions. [2025-03-09 05:55:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:55:28,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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 110 [2025-03-09 05:55:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:28,556 INFO L225 Difference]: With dead ends: 870 [2025-03-09 05:55:28,556 INFO L226 Difference]: Without dead ends: 869 [2025-03-09 05:55:28,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 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:55:28,557 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 0 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:28,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3185 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-09 05:55:28,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2025-03-09 05:55:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 786 states have (on average 1.3587786259541985) internal successors, (1068), 813 states have internal predecessors, (1068), 46 states have call successors, (46), 18 states have call predecessors, (46), 17 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2025-03-09 05:55:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1157 transitions. [2025-03-09 05:55:28,592 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1157 transitions. Word has length 110 [2025-03-09 05:55:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:28,592 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1157 transitions. [2025-03-09 05:55:28,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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:55:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1157 transitions. [2025-03-09 05:55:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 05:55:28,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:28,593 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:28,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 05:55:28,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 05:55:28,794 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:28,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2122022802, now seen corresponding path program 1 times [2025-03-09 05:55:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001581673] [2025-03-09 05:55:28,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:28,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 05:55:28,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 05:55:28,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:28,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-09 05:55:33,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:33,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001581673] [2025-03-09 05:55:33,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001581673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:33,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126391718] [2025-03-09 05:55:33,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:33,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:33,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:33,389 INFO L229 MonitoredProcess]: Starting monitored process 15 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:55:33,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 05:55:33,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 05:55:34,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 05:55:34,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:34,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:34,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 05:55:34,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:34,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:35,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126391718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:35,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:35,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 28 [2025-03-09 05:55:35,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817408970] [2025-03-09 05:55:35,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:35,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 05:55:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:35,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 05:55:35,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2025-03-09 05:55:35,025 INFO L87 Difference]: Start difference. First operand 869 states and 1157 transitions. Second operand has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 28 states have internal predecessors, (93), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 05:55:43,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:55:44,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:55:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:47,554 INFO L93 Difference]: Finished difference Result 1965 states and 2765 transitions. [2025-03-09 05:55:47,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-09 05:55:47,554 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 28 states have internal predecessors, (93), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 113 [2025-03-09 05:55:47,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:47,560 INFO L225 Difference]: With dead ends: 1965 [2025-03-09 05:55:47,560 INFO L226 Difference]: Without dead ends: 1358 [2025-03-09 05:55:47,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=497, Invalid=2695, Unknown=0, NotChecked=0, Total=3192 [2025-03-09 05:55:47,562 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 2244 mSDsluCounter, 9430 mSDsCounter, 0 mSdLazyCounter, 4020 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2246 SdHoareTripleChecker+Valid, 10135 SdHoareTripleChecker+Invalid, 4250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 4020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:47,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2246 Valid, 10135 Invalid, 4250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 4020 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2025-03-09 05:55:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-03-09 05:55:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 879. [2025-03-09 05:55:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 796 states have (on average 1.3655778894472361) internal successors, (1087), 823 states have internal predecessors, (1087), 46 states have call successors, (46), 18 states have call predecessors, (46), 17 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2025-03-09 05:55:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1176 transitions. [2025-03-09 05:55:47,597 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1176 transitions. Word has length 113 [2025-03-09 05:55:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:47,597 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1176 transitions. [2025-03-09 05:55:47,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4444444444444446) internal successors, (93), 28 states have internal predecessors, (93), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 05:55:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1176 transitions. [2025-03-09 05:55:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-09 05:55:47,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:47,598 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:47,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 05:55:47,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:47,799 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-09 05:55:47,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1439079505, now seen corresponding path program 1 times [2025-03-09 05:55:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852059870] [2025-03-09 05:55:47,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:47,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 05:55:48,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 05:55:48,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:48,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:48,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852059870] [2025-03-09 05:55:48,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852059870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:48,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066947706] [2025-03-09 05:55:48,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:48,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:48,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:48,653 INFO L229 MonitoredProcess]: Starting monitored process 16 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:55:48,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 05:55:49,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 05:55:57,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 05:55:57,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:57,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:57,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 05:55:57,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:57,805 INFO L312 TraceCheckSpWp]: Computing backward predicates...