./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-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/printf-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 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:54:18,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:54:18,881 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:18,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:54:18,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:54:18,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:54:18,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:54:18,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:54:18,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:54:18,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:54:18,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:54:18,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:54:18,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:54:18,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:54:18,914 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:54:18,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:54:18,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:54:18,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:54:18,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:54:18,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:54:18,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:54:18,916 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 -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-03-09 05:54:19,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:54:19,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:54:19,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:54:19,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:54:19,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:54:19,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-09 05:54:20,335 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4e38bfe/0c74a30ceb6f43bab7c3bdf14a86e6e6/FLAG21d6d24fc [2025-03-09 05:54:20,732 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:54:20,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-09 05:54:20,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4e38bfe/0c74a30ceb6f43bab7c3bdf14a86e6e6/FLAG21d6d24fc [2025-03-09 05:54:20,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4e38bfe/0c74a30ceb6f43bab7c3bdf14a86e6e6 [2025-03-09 05:54:20,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:54:20,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:54:20,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:54:20,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:54:20,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:54:20,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:54:20" (1/1) ... [2025-03-09 05:54:20,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13226f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:20, skipping insertion in model container [2025-03-09 05:54:20,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:54:20" (1/1) ... [2025-03-09 05:54:20,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:54:21,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:54:21,804 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:54:21,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:54:22,075 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:54:22,082 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:54:22,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:22 WrapperNode [2025-03-09 05:54:22,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:54:22,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:54:22,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:54:22,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:54:22,088 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:22" (1/1) ... [2025-03-09 05:54:22,127 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:22" (1/1) ... [2025-03-09 05:54:22,194 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1861 [2025-03-09 05:54:22,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:54:22,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:54:22,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:54:22,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:54:22,203 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:22" (1/1) ... [2025-03-09 05:54:22,203 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:22" (1/1) ... [2025-03-09 05:54:22,218 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:22" (1/1) ... [2025-03-09 05:54:22,229 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:54:22,230 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:22" (1/1) ... [2025-03-09 05:54:22,231 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:22" (1/1) ... [2025-03-09 05:54:22,293 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:22" (1/1) ... [2025-03-09 05:54:22,298 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:22" (1/1) ... [2025-03-09 05:54:22,309 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:22" (1/1) ... [2025-03-09 05:54:22,321 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:22" (1/1) ... [2025-03-09 05:54:22,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:54:22,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:54:22,342 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:54:22,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:54:22,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:22" (1/1) ... [2025-03-09 05:54:22,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:54:22,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:22,369 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:22,372 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:22,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-09 05:54:22,389 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-09 05:54:22,389 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-09 05:54:22,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:54:22,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-09 05:54:22,389 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-09 05:54:22,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-09 05:54:22,390 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-09 05:54:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-09 05:54:22,391 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-09 05:54:22,391 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-09 05:54:22,391 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:54:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-09 05:54:22,391 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-09 05:54:22,786 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:54:22,791 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:54:22,879 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-09 05:54:23,088 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-03-09 05:54:23,140 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-03-09 05:54:23,280 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-03-09 05:54:23,280 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-09 05:54:23,280 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-03-09 05:54:23,280 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-03-09 05:54:28,028 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-03-09 05:54:28,028 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-03-09 05:54:28,028 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-03-09 05:54:28,139 INFO L? ?]: Removed 610 outVars from TransFormulas that were not future-live. [2025-03-09 05:54:28,139 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:54:28,165 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:54:28,168 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:54:28,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:28 BoogieIcfgContainer [2025-03-09 05:54:28,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:54:28,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:54:28,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:54:28,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:54:28,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:54:20" (1/3) ... [2025-03-09 05:54:28,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d35ebc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:54:28, skipping insertion in model container [2025-03-09 05:54:28,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:22" (2/3) ... [2025-03-09 05:54:28,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d35ebc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:54:28, skipping insertion in model container [2025-03-09 05:54:28,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:28" (3/3) ... [2025-03-09 05:54:28,175 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-09 05:54:28,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:54:28,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 491 locations, 1 initial locations, 23 loop locations, and 44 error locations. [2025-03-09 05:54:28,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:54:28,247 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;@353a3488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:54:28,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-09 05:54:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 491 states, 380 states have (on average 1.5763157894736841) internal successors, (599), 439 states have internal predecessors, (599), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-09 05:54:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:54:28,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:28,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:54:28,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:28,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 24318335, now seen corresponding path program 1 times [2025-03-09 05:54:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481116312] [2025-03-09 05:54:28,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:28,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:28,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:54:29,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:54:29,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:29,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:29,382 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:29,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481116312] [2025-03-09 05:54:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481116312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:29,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720783881] [2025-03-09 05:54:29,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:29,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:29,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:29,410 INFO L87 Difference]: Start difference. First operand has 491 states, 380 states have (on average 1.5763157894736841) internal successors, (599), 439 states have internal predecessors, (599), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) 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:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:29,565 INFO L93 Difference]: Finished difference Result 883 states and 1320 transitions. [2025-03-09 05:54:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:29,567 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:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:29,575 INFO L225 Difference]: With dead ends: 883 [2025-03-09 05:54:29,575 INFO L226 Difference]: Without dead ends: 378 [2025-03-09 05:54:29,581 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:29,583 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:29,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1077 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-09 05:54:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-03-09 05:54:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 317 states have (on average 1.4258675078864353) internal successors, (452), 333 states have internal predecessors, (452), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 519 transitions. [2025-03-09 05:54:29,642 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 519 transitions. Word has length 4 [2025-03-09 05:54:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:29,643 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 519 transitions. [2025-03-09 05:54:29,643 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:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 519 transitions. [2025-03-09 05:54:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:54:29,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:29,644 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:54:29,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:54:29,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:29,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1381235981, now seen corresponding path program 1 times [2025-03-09 05:54:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:29,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884822212] [2025-03-09 05:54:29,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:29,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:30,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:54:30,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:54:30,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:30,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:30,589 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:30,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:30,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884822212] [2025-03-09 05:54:30,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884822212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:30,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335488841] [2025-03-09 05:54:30,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:30,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:30,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:30,594 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:30,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:54:31,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:54:31,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:54:31,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:31,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:31,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1683 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:31,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:31,601 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:31,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:31,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335488841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:31,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:31,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:54:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142835048] [2025-03-09 05:54:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:31,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:54:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:31,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:54:31,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:31,603 INFO L87 Difference]: Start difference. First operand 378 states and 519 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:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:31,694 INFO L93 Difference]: Finished difference Result 378 states and 519 transitions. [2025-03-09 05:54:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:54:31,698 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:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:31,700 INFO L225 Difference]: With dead ends: 378 [2025-03-09 05:54:31,700 INFO L226 Difference]: Without dead ends: 377 [2025-03-09 05:54:31,701 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:31,703 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:31,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1011 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-09 05:54:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-09 05:54:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 332 states have internal predecessors, (451), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 518 transitions. [2025-03-09 05:54:31,729 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 518 transitions. Word has length 7 [2025-03-09 05:54:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:31,729 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 518 transitions. [2025-03-09 05:54:31,729 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:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 518 transitions. [2025-03-09 05:54:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:54:31,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:31,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:54:31,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:54:31,931 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:31,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:31,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash 131358273, now seen corresponding path program 1 times [2025-03-09 05:54:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:31,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030107008] [2025-03-09 05:54:31,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:32,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:54:32,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:54:32,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:32,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:32,541 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:32,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:32,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030107008] [2025-03-09 05:54:32,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030107008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:32,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:32,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343903928] [2025-03-09 05:54:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:32,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:32,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:32,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:32,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:32,543 INFO L87 Difference]: Start difference. First operand 377 states and 518 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:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:32,594 INFO L93 Difference]: Finished difference Result 377 states and 518 transitions. [2025-03-09 05:54:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:32,595 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:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:32,596 INFO L225 Difference]: With dead ends: 377 [2025-03-09 05:54:32,597 INFO L226 Difference]: Without dead ends: 376 [2025-03-09 05:54:32,597 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:32,597 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:32,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-09 05:54:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2025-03-09 05:54:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 315 states have (on average 1.4222222222222223) internal successors, (448), 329 states have internal predecessors, (448), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 515 transitions. [2025-03-09 05:54:32,620 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 515 transitions. Word has length 8 [2025-03-09 05:54:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:32,620 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 515 transitions. [2025-03-09 05:54:32,620 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:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 515 transitions. [2025-03-09 05:54:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:54:32,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:32,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:32,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:54:32,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:32,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1076748584, now seen corresponding path program 1 times [2025-03-09 05:54:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075900802] [2025-03-09 05:54:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:33,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:54:33,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:54:33,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:33,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:33,355 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:33,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075900802] [2025-03-09 05:54:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075900802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:33,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369022955] [2025-03-09 05:54:33,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:33,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:33,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:33,358 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:33,360 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:34,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:54:34,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:54:34,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:34,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:34,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:54:34,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:34,343 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:34,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:34,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369022955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:34,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:34,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:54:34,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723583098] [2025-03-09 05:54:34,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:34,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:34,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:34,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:34,345 INFO L87 Difference]: Start difference. First operand 374 states and 515 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:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:34,408 INFO L93 Difference]: Finished difference Result 374 states and 515 transitions. [2025-03-09 05:54:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:34,409 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:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:34,411 INFO L225 Difference]: With dead ends: 374 [2025-03-09 05:54:34,411 INFO L226 Difference]: Without dead ends: 372 [2025-03-09 05:54:34,412 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:34,413 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 163 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:34,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 830 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-09 05:54:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-03-09 05:54:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 315 states have (on average 1.415873015873016) internal successors, (446), 327 states have internal predecessors, (446), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 513 transitions. [2025-03-09 05:54:34,422 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 513 transitions. Word has length 12 [2025-03-09 05:54:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:34,423 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 513 transitions. [2025-03-09 05:54:34,423 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:34,423 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 513 transitions. [2025-03-09 05:54:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:54:34,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:34,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:34,433 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:34,624 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:34,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:34,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:34,625 INFO L85 PathProgramCache]: Analyzing trace with hash 980532982, now seen corresponding path program 1 times [2025-03-09 05:54:34,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:34,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018390397] [2025-03-09 05:54:34,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:35,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:54:35,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:54:35,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:35,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:35,233 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:35,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018390397] [2025-03-09 05:54:35,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018390397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:35,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919822597] [2025-03-09 05:54:35,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:35,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:35,236 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:35,237 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:35,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:54:36,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:54:36,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:36,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:36,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:36,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:36,225 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:36,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:36,292 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:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919822597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:36,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:54:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612017901] [2025-03-09 05:54:36,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:36,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:36,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:36,293 INFO L87 Difference]: Start difference. First operand 372 states and 513 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:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:36,387 INFO L93 Difference]: Finished difference Result 747 states and 1031 transitions. [2025-03-09 05:54:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:36,388 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:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:36,390 INFO L225 Difference]: With dead ends: 747 [2025-03-09 05:54:36,390 INFO L226 Difference]: Without dead ends: 381 [2025-03-09 05:54:36,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:36,391 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 4 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:36,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1511 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-09 05:54:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-09 05:54:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 324 states have (on average 1.404320987654321) internal successors, (455), 336 states have internal predecessors, (455), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 522 transitions. [2025-03-09 05:54:36,401 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 522 transitions. Word has length 13 [2025-03-09 05:54:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:36,401 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 522 transitions. [2025-03-09 05:54:36,402 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:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 522 transitions. [2025-03-09 05:54:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:54:36,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:36,402 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:36,413 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:36,603 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:36,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:36,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 192220034, now seen corresponding path program 2 times [2025-03-09 05:54:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347376525] [2025-03-09 05:54:36,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:37,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:54:37,141 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:37,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:54:37,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:37,575 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:37,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:37,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347376525] [2025-03-09 05:54:37,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347376525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:37,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:37,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:54:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177566873] [2025-03-09 05:54:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:37,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:54:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:37,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:54:37,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:37,576 INFO L87 Difference]: Start difference. First operand 381 states and 522 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:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:37,744 INFO L93 Difference]: Finished difference Result 381 states and 522 transitions. [2025-03-09 05:54:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:54:37,745 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:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:37,747 INFO L225 Difference]: With dead ends: 381 [2025-03-09 05:54:37,748 INFO L226 Difference]: Without dead ends: 379 [2025-03-09 05:54:37,749 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:37,750 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 162 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:37,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1811 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-09 05:54:37,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-03-09 05:54:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 324 states have (on average 1.3981481481481481) internal successors, (453), 334 states have internal predecessors, (453), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2025-03-09 05:54:37,770 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 22 [2025-03-09 05:54:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:37,772 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2025-03-09 05:54:37,772 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:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2025-03-09 05:54:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:54:37,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:37,773 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:37,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:54:37,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:37,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:37,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1584861081, now seen corresponding path program 1 times [2025-03-09 05:54:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653014350] [2025-03-09 05:54:37,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:37,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:38,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:54:38,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:54:38,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:38,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:38,448 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:38,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:38,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653014350] [2025-03-09 05:54:38,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653014350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:38,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:38,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:54:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758923269] [2025-03-09 05:54:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:38,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:38,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:38,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:38,450 INFO L87 Difference]: Start difference. First operand 379 states and 520 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:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:38,517 INFO L93 Difference]: Finished difference Result 741 states and 1024 transitions. [2025-03-09 05:54:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:38,519 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:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:38,521 INFO L225 Difference]: With dead ends: 741 [2025-03-09 05:54:38,521 INFO L226 Difference]: Without dead ends: 382 [2025-03-09 05:54:38,522 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:38,523 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 2 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:38,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1001 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-09 05:54:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-09 05:54:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 327 states have (on average 1.3944954128440368) internal successors, (456), 337 states have internal predecessors, (456), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 523 transitions. [2025-03-09 05:54:38,544 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 523 transitions. Word has length 27 [2025-03-09 05:54:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:38,545 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 523 transitions. [2025-03-09 05:54:38,545 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:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 523 transitions. [2025-03-09 05:54:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:54:38,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:38,546 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:38,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:54:38,546 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:38,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash -15509573, now seen corresponding path program 1 times [2025-03-09 05:54:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:38,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074026290] [2025-03-09 05:54:38,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:38,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:38,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:38,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:38,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:39,156 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:39,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:39,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074026290] [2025-03-09 05:54:39,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074026290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:39,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:39,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618036675] [2025-03-09 05:54:39,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:39,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:39,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:39,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:39,158 INFO L87 Difference]: Start difference. First operand 382 states and 523 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:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:39,233 INFO L93 Difference]: Finished difference Result 395 states and 538 transitions. [2025-03-09 05:54:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:39,233 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:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:39,236 INFO L225 Difference]: With dead ends: 395 [2025-03-09 05:54:39,236 INFO L226 Difference]: Without dead ends: 393 [2025-03-09 05:54:39,236 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,237 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 3 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:39,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 998 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-09 05:54:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2025-03-09 05:54:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 336 states have (on average 1.3958333333333333) internal successors, (469), 346 states have internal predecessors, (469), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 536 transitions. [2025-03-09 05:54:39,256 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 536 transitions. Word has length 30 [2025-03-09 05:54:39,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:39,257 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 536 transitions. [2025-03-09 05:54:39,257 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:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 536 transitions. [2025-03-09 05:54:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:54:39,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:39,258 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:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:54:39,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:39,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -15509413, now seen corresponding path program 1 times [2025-03-09 05:54:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043684520] [2025-03-09 05:54:39,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:39,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:39,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:39,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:39,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:39,881 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:39,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:39,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043684520] [2025-03-09 05:54:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043684520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:39,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787015877] [2025-03-09 05:54:39,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:39,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:39,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:39,883 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:39,885 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:40,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:40,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:40,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:40,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:40,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:54:40,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:40,963 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:40,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:41,135 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:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787015877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:41,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:54:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100061927] [2025-03-09 05:54:41,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:41,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:54:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:41,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:54:41,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:41,137 INFO L87 Difference]: Start difference. First operand 391 states and 536 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:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:41,484 INFO L93 Difference]: Finished difference Result 784 states and 1080 transitions. [2025-03-09 05:54:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:54:41,485 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:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:41,489 INFO L225 Difference]: With dead ends: 784 [2025-03-09 05:54:41,489 INFO L226 Difference]: Without dead ends: 408 [2025-03-09 05:54:41,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:41,492 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 5 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:41,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2477 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:54:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-09 05:54:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-09 05:54:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 354 states have (on average 1.3700564971751412) internal successors, (485), 363 states have internal predecessors, (485), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 552 transitions. [2025-03-09 05:54:41,508 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 552 transitions. Word has length 30 [2025-03-09 05:54:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:41,509 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 552 transitions. [2025-03-09 05:54:41,509 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:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 552 transitions. [2025-03-09 05:54:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:54:41,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:41,514 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:41,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 05:54:41,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:41,714 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:41,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash 225096521, now seen corresponding path program 1 times [2025-03-09 05:54:41,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:41,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300269736] [2025-03-09 05:54:41,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:42,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:54:42,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:54:42,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:42,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:42,374 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:42,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300269736] [2025-03-09 05:54:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300269736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908198163] [2025-03-09 05:54:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:42,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:42,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:42,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:42,376 INFO L87 Difference]: Start difference. First operand 408 states and 552 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:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:42,430 INFO L93 Difference]: Finished difference Result 408 states and 552 transitions. [2025-03-09 05:54:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:42,432 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:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:42,434 INFO L225 Difference]: With dead ends: 408 [2025-03-09 05:54:42,434 INFO L226 Difference]: Without dead ends: 407 [2025-03-09 05:54:42,434 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:42,435 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:42,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 999 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:42,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-09 05:54:42,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2025-03-09 05:54:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 350 states have (on average 1.3685714285714285) internal successors, (479), 358 states have internal predecessors, (479), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 546 transitions. [2025-03-09 05:54:42,451 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 546 transitions. Word has length 49 [2025-03-09 05:54:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:42,451 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 546 transitions. [2025-03-09 05:54:42,451 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:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 546 transitions. [2025-03-09 05:54:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:54:42,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:42,452 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] [2025-03-09 05:54:42,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 05:54:42,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1278889527, now seen corresponding path program 1 times [2025-03-09 05:54:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438351083] [2025-03-09 05:54:42,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:42,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:54:42,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:54:42,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:42,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:43,024 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:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438351083] [2025-03-09 05:54:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438351083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382584850] [2025-03-09 05:54:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:43,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:43,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:43,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:43,025 INFO L87 Difference]: Start difference. First operand 403 states and 546 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:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:43,084 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2025-03-09 05:54:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:43,085 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:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:43,087 INFO L225 Difference]: With dead ends: 408 [2025-03-09 05:54:43,087 INFO L226 Difference]: Without dead ends: 406 [2025-03-09 05:54:43,087 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:43,088 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:43,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 998 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:54:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-09 05:54:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-09 05:54:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 353 states have (on average 1.3654390934844192) internal successors, (482), 361 states have internal predecessors, (482), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 549 transitions. [2025-03-09 05:54:43,110 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 549 transitions. Word has length 49 [2025-03-09 05:54:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:43,110 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 549 transitions. [2025-03-09 05:54:43,115 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:43,115 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 549 transitions. [2025-03-09 05:54:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 05:54:43,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:43,115 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:43,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:54:43,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:43,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:43,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1257462711, now seen corresponding path program 1 times [2025-03-09 05:54:43,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:43,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141722605] [2025-03-09 05:54:43,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:43,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:43,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 05:54:43,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 05:54:43,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:43,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:54:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:43,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141722605] [2025-03-09 05:54:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141722605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214363073] [2025-03-09 05:54:43,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:43,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:43,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:43,844 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:43,846 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:44,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 05:54:44,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 05:54:44,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:44,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:44,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:54:44,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:44,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:44,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214363073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:44,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:44,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-03-09 05:54:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172667492] [2025-03-09 05:54:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:44,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:54:44,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:44,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:54:44,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:44,938 INFO L87 Difference]: Start difference. First operand 406 states and 549 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:45,023 INFO L93 Difference]: Finished difference Result 417 states and 561 transitions. [2025-03-09 05:54:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:54:45,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 52 [2025-03-09 05:54:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:45,025 INFO L225 Difference]: With dead ends: 417 [2025-03-09 05:54:45,025 INFO L226 Difference]: Without dead ends: 408 [2025-03-09 05:54:45,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:45,026 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:45,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1500 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-09 05:54:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-09 05:54:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 355 states have (on average 1.3633802816901408) internal successors, (484), 363 states have internal predecessors, (484), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 551 transitions. [2025-03-09 05:54:45,049 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 551 transitions. Word has length 52 [2025-03-09 05:54:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:45,054 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 551 transitions. [2025-03-09 05:54:45,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 551 transitions. [2025-03-09 05:54:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:54:45,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:45,054 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:45,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:54:45,255 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:45,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:45,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash -621653985, now seen corresponding path program 1 times [2025-03-09 05:54:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:45,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041567800] [2025-03-09 05:54:45,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:45,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:54:45,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:54:45,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:45,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:45,985 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:45,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:45,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041567800] [2025-03-09 05:54:45,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041567800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:45,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681467250] [2025-03-09 05:54:45,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:45,988 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:45,989 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:47,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:54:47,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:54:47,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:47,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:47,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:47,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:47,284 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:47,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:47,331 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:47,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681467250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:47,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:47,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:54:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964683269] [2025-03-09 05:54:47,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:47,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:47,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:47,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:47,334 INFO L87 Difference]: Start difference. First operand 408 states and 551 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:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:47,458 INFO L93 Difference]: Finished difference Result 791 states and 1079 transitions. [2025-03-09 05:54:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:47,459 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:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:47,461 INFO L225 Difference]: With dead ends: 791 [2025-03-09 05:54:47,461 INFO L226 Difference]: Without dead ends: 426 [2025-03-09 05:54:47,463 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:47,464 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 4 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:47,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1995 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-09 05:54:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-09 05:54:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 373 states have (on average 1.3458445040214477) internal successors, (502), 381 states have internal predecessors, (502), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:54:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 569 transitions. [2025-03-09 05:54:47,482 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 569 transitions. Word has length 55 [2025-03-09 05:54:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:47,482 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 569 transitions. [2025-03-09 05:54:47,483 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:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 569 transitions. [2025-03-09 05:54:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 05:54:47,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:47,484 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:47,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 05:54:47,684 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:47,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:47,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1036700240, now seen corresponding path program 1 times [2025-03-09 05:54:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197447643] [2025-03-09 05:54:47,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:48,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 05:54:48,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 05:54:48,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:48,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:54:48,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197447643] [2025-03-09 05:54:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197447643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141831292] [2025-03-09 05:54:48,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:48,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:48,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:48,391 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:48,392 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,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 05:54:49,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 05:54:49,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:49,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:54:49,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:54:49,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:49,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141831292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:49,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:49,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-09 05:54:49,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487217793] [2025-03-09 05:54:49,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:49,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:54:49,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:49,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:54:49,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:49,666 INFO L87 Difference]: Start difference. First operand 426 states and 569 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:49,894 INFO L93 Difference]: Finished difference Result 546 states and 744 transitions. [2025-03-09 05:54:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:54:49,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 56 [2025-03-09 05:54:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:49,898 INFO L225 Difference]: With dead ends: 546 [2025-03-09 05:54:49,898 INFO L226 Difference]: Without dead ends: 533 [2025-03-09 05:54:49,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:49,900 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 140 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:49,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1639 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:54:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-09 05:54:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 530. [2025-03-09 05:54:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 466 states have (on average 1.3626609442060085) internal successors, (635), 476 states have internal predecessors, (635), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-09 05:54:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 723 transitions. [2025-03-09 05:54:49,919 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 723 transitions. Word has length 56 [2025-03-09 05:54:49,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:49,919 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 723 transitions. [2025-03-09 05:54:49,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 723 transitions. [2025-03-09 05:54:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 05:54:49,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:49,920 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] [2025-03-09 05:54:49,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 05:54:50,121 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,121 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:50,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash 93051279, now seen corresponding path program 1 times [2025-03-09 05:54:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:50,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543021950] [2025-03-09 05:54:50,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:50,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 05:54:50,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 05:54:50,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:50,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:50,785 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,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543021950] [2025-03-09 05:54:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543021950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:50,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:54:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199014891] [2025-03-09 05:54:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:54:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:50,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:54:50,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:50,787 INFO L87 Difference]: Start difference. First operand 530 states and 723 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:50,929 INFO L93 Difference]: Finished difference Result 546 states and 738 transitions. [2025-03-09 05:54:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:50,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-09 05:54:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:50,931 INFO L225 Difference]: With dead ends: 546 [2025-03-09 05:54:50,931 INFO L226 Difference]: Without dead ends: 543 [2025-03-09 05:54:50,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:54:50,932 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 17 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:50,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2487 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:50,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-09 05:54:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 540. [2025-03-09 05:54:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 473 states have (on average 1.3594080338266386) internal successors, (643), 483 states have internal predecessors, (643), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-09 05:54:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 733 transitions. [2025-03-09 05:54:50,948 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 733 transitions. Word has length 58 [2025-03-09 05:54:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:50,948 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 733 transitions. [2025-03-09 05:54:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 733 transitions. [2025-03-09 05:54:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 05:54:50,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:50,949 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] [2025-03-09 05:54:50,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 05:54:50,949 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:50,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash 93052240, now seen corresponding path program 1 times [2025-03-09 05:54:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:50,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281249094] [2025-03-09 05:54:50,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 05:54:51,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 05:54:51,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:51,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:51,802 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,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:51,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281249094] [2025-03-09 05:54:51,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281249094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:51,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:51,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:54:51,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833789443] [2025-03-09 05:54:51,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:51,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:54:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:51,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:54:51,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:51,803 INFO L87 Difference]: Start difference. First operand 540 states and 733 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:51,946 INFO L93 Difference]: Finished difference Result 785 states and 1060 transitions. [2025-03-09 05:54:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:51,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-09 05:54:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:51,949 INFO L225 Difference]: With dead ends: 785 [2025-03-09 05:54:51,949 INFO L226 Difference]: Without dead ends: 436 [2025-03-09 05:54:51,950 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,951 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 170 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:51,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1943 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-09 05:54:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-09 05:54:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 380 states have (on average 1.3394736842105264) internal successors, (509), 388 states have internal predecessors, (509), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-09 05:54:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 578 transitions. [2025-03-09 05:54:51,962 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 578 transitions. Word has length 58 [2025-03-09 05:54:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:51,962 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 578 transitions. [2025-03-09 05:54:51,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 578 transitions. [2025-03-09 05:54:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 05:54:51,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:51,963 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 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] [2025-03-09 05:54:51,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 05:54:51,963 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:51,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:51,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1946246152, now seen corresponding path program 1 times [2025-03-09 05:54:51,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:51,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970338253] [2025-03-09 05:54:51,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:51,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:52,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 05:54:52,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 05:54:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:54:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970338253] [2025-03-09 05:54:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970338253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004247966] [2025-03-09 05:54:52,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:52,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:52,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:52,645 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,656 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:53,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 05:54:53,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 05:54:53,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:53,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:53,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:54:53,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:54,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:54,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004247966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:54,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:54,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:54:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296578573] [2025-03-09 05:54:54,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:54,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:54:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:54,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:54:54,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:54,217 INFO L87 Difference]: Start difference. First operand 436 states and 578 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:54,474 INFO L93 Difference]: Finished difference Result 855 states and 1149 transitions. [2025-03-09 05:54:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:54:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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 72 [2025-03-09 05:54:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:54,477 INFO L225 Difference]: With dead ends: 855 [2025-03-09 05:54:54,477 INFO L226 Difference]: Without dead ends: 471 [2025-03-09 05:54:54,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:54,479 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 5 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:54,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3456 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:54:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-09 05:54:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-09 05:54:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 416 states have (on average 1.3076923076923077) internal successors, (544), 423 states have internal predecessors, (544), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-09 05:54:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 613 transitions. [2025-03-09 05:54:54,493 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 613 transitions. Word has length 72 [2025-03-09 05:54:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:54,493 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 613 transitions. [2025-03-09 05:54:54,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 613 transitions. [2025-03-09 05:54:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 05:54:54,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:54,497 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] [2025-03-09 05:54:54,513 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:54:54,697 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,SelfDestructingSolverStorable16 [2025-03-09 05:54:54,698 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:54:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1440726392, now seen corresponding path program 1 times [2025-03-09 05:54:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070305968] [2025-03-09 05:54:54,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:55,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 05:54:55,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 05:54:55,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:55,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:54:55,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 05:54:55,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 05:54:55,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 05:54:55,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:55,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:54:55,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 05:54:55,838 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 05:54:55,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE (43 of 44 remaining) [2025-03-09 05:54:55,846 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (34 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 44 remaining) [2025-03-09 05:54:55,847 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 44 remaining) [2025-03-09 05:54:55,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 44 remaining) [2025-03-09 05:54:55,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 44 remaining) [2025-03-09 05:54:55,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 44 remaining) [2025-03-09 05:54:55,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 44 remaining) [2025-03-09 05:54:55,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 44 remaining) [2025-03-09 05:54:55,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 44 remaining) [2025-03-09 05:54:55,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 44 remaining) [2025-03-09 05:54:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 05:54:55,855 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:55,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:54:55,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:54:55 BoogieIcfgContainer [2025-03-09 05:54:55,978 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:54:55,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:54:55,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:54:55,980 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:54:55,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:28" (3/4) ... [2025-03-09 05:54:55,996 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 05:54:55,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:54:55,998 INFO L158 Benchmark]: Toolchain (without parser) took 35086.00ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 117.6MB in the beginning and 199.7MB in the end (delta: -82.1MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2025-03-09 05:54:55,999 INFO L158 Benchmark]: CDTParser took 1.46ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:54:55,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1170.25ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 85.7MB in the end (delta: 31.8MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. [2025-03-09 05:54:55,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.36ms. Allocated memory is still 167.8MB. Free memory was 85.7MB in the beginning and 72.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 05:54:55,999 INFO L158 Benchmark]: Boogie Preprocessor took 145.32ms. Allocated memory is still 167.8MB. Free memory was 72.3MB in the beginning and 60.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:54:56,000 INFO L158 Benchmark]: IcfgBuilder took 5826.78ms. Allocated memory is still 167.8MB. Free memory was 59.7MB in the beginning and 58.8MB in the end (delta: 909.9kB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2025-03-09 05:54:56,000 INFO L158 Benchmark]: TraceAbstraction took 27808.94ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 58.8MB in the beginning and 204.0MB in the end (delta: -145.2MB). Peak memory consumption was 760.2MB. Max. memory is 16.1GB. [2025-03-09 05:54:56,001 INFO L158 Benchmark]: Witness Printer took 17.72ms. Allocated memory is still 310.4MB. Free memory was 204.0MB in the beginning and 199.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:54:56,002 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1170.25ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 85.7MB in the end (delta: 31.8MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.36ms. Allocated memory is still 167.8MB. Free memory was 85.7MB in the beginning and 72.3MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.32ms. Allocated memory is still 167.8MB. Free memory was 72.3MB in the beginning and 60.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 5826.78ms. Allocated memory is still 167.8MB. Free memory was 59.7MB in the beginning and 58.8MB in the end (delta: 909.9kB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27808.94ms. Allocated memory was 167.8MB in the beginning and 310.4MB in the end (delta: 142.6MB). Free memory was 58.8MB in the beginning and 204.0MB in the end (delta: -145.2MB). Peak memory consumption was 760.2MB. Max. memory is 16.1GB. * Witness Printer took 17.72ms. Allocated memory is still 310.4MB. Free memory was 204.0MB in the beginning and 199.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1135]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of undefined function vasprintf at line 1135. Possible FailurePath: [L2370] static const char *applet_name; [L2371] static signed int bb_errno_location; [L2372] static signed int * const bb_errno = &bb_errno_location; [L2373] static const char bb_msg_memory_exhausted[14l] = { (const char)111, (const char)117, (const char)116, (const char)32, (const char)111, (const char)102, (const char)32, (const char)109, (const char)101, (const char)109, (const char)111, (const char)114, (const char)121, (const char)0 }; [L2374] static struct __jmp_buf_tag die_jmp[1l]; [L2375] static signed int die_sleep; [L2376] static char local_buf[(signed long int)(sizeof(signed int) * 3) ]; [L2377] static signed char logmode = (signed char)1; [L2378] static const char *msg_eol = "\n"; [L2379] static unsigned char xfunc_error_retval = (unsigned char)1; [L2445] static const char charmap[20l] = { (const char)97, (const char)98, (const char)101, (const char)102, (const char)110, (const char)114, (const char)116, (const char)118, (const char)92, (const char)0, (const char)7, (const char)8, (const char)27, (const char)12, (const char)10, (const char)13, (const char)9, (const char)11, (const char)92, (const char)92 }; [L3133] static const char format_chars[14l] = { (const char)100, (const char)105, (const char)111, (const char)117, (const char)120, (const char)88, (const char)102, (const char)101, (const char)69, (const char)103, (const char)71, (const char)99, (const char)115, (const char)0 }; [L3336] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3399] char *a = malloc(11); [L3400] a[10] = 0 [L3401] int i=0; VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=1, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=1, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=2, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=2, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=3, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=3, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=4, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=4, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=5, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=5, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=6, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=6, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=7, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=7, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=8, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=8, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=9, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=9, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={331:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=10, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND FALSE !(i<10) [L3403] applet_name = a [L3404] bb_errno_location = __VERIFIER_nondet_int() [L3405] optind = 1 [L3406] int argc = __VERIFIER_nondet_int(); [L3407] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={331:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={331:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3407] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={331:0}, argc=1, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3408] EXPR argc+1 [L3408] char **argv=malloc((argc+1)*sizeof(char*)); [L3409] EXPR argc+1 [L3409] char **mem_track=malloc((argc+1)*sizeof(char*)); [L3410] argv[argc]=0 [L3411] int i=0; VAL [applet_name={331:0}, argc=1, argv={-12:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, mem_track={-13:0}, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3411] COND TRUE i 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 -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-03-09 05:54:58,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:54:58,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:54:58,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:54:58,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:54:58,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:54:58,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-09 05:54:59,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaafb7d59/bc6a0e25038945dd8fee6851addd44c0/FLAGde2a0abb9 [2025-03-09 05:54:59,883 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:54:59,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-09 05:54:59,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaafb7d59/bc6a0e25038945dd8fee6851addd44c0/FLAGde2a0abb9 [2025-03-09 05:55:00,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaafb7d59/bc6a0e25038945dd8fee6851addd44c0 [2025-03-09 05:55:00,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:55:00,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:55:00,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:55:00,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:55:00,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:55:00,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:55:00" (1/1) ... [2025-03-09 05:55:00,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177d7dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:00, skipping insertion in model container [2025-03-09 05:55:00,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:55:00" (1/1) ... [2025-03-09 05:55:00,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:55:00,893 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,895 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,910 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,914 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,915 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,917 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,918 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,918 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,919 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,919 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,920 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,920 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,921 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,922 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,923 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,924 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,924 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,929 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,929 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,930 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,930 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,930 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,930 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,932 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,932 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,936 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,940 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,943 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,945 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,947 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,953 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,955 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,960 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,961 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,962 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,966 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,968 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,972 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,975 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,978 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,981 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,981 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,982 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,982 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,982 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,991 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,996 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:00,999 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,002 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,006 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,011 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,011 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,014 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,015 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,016 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,017 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,025 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,027 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,029 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,042 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,054 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:55:01,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:55:01,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:55:01,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:55:01,413 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:55:01,421 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:55:01,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01 WrapperNode [2025-03-09 05:55:01,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:55:01,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:55:01,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:55:01,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:55:01,427 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:55:01" (1/1) ... [2025-03-09 05:55:01,460 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:55:01" (1/1) ... [2025-03-09 05:55:01,527 INFO L138 Inliner]: procedures = 663, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1803 [2025-03-09 05:55:01,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:55:01,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:55:01,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:55:01,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:55:01,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,556 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:55:01,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:55:01,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:55:01,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:55:01,677 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:55:01,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (1/1) ... [2025-03-09 05:55:01,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:55:01,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:01,706 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:55:01,713 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:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-09 05:55:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-09 05:55:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:55:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-09 05:55:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:55:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2025-03-09 05:55:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-03-09 05:55:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-03-09 05:55:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-03-09 05:55:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:55:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:55:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-09 05:55:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-09 05:55:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-03-09 05:55:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:55:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-09 05:55:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-09 05:55:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:55:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-09 05:55:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-09 05:55:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intFLOATTYPE8 [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-09 05:55:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-09 05:55:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-09 05:55:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-09 05:55:01,735 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-09 05:55:01,735 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-09 05:55:02,094 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:55:02,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:55:02,197 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-09 05:55:02,593 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-03-09 05:55:02,662 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-03-09 05:55:02,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem159#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-03-09 05:55:02,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-09 05:55:02,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem161#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-03-09 05:55:02,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem163#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-03-09 05:55:11,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem307#1;havoc __main_#t~short308#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-03-09 05:55:11,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-03-09 05:55:11,277 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-03-09 05:55:11,374 INFO L? ?]: Removed 586 outVars from TransFormulas that were not future-live. [2025-03-09 05:55:11,374 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:55:11,394 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:55:11,394 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:55:11,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:55:11 BoogieIcfgContainer [2025-03-09 05:55:11,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:55:11,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:55:11,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:55:11,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:55:11,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:55:00" (1/3) ... [2025-03-09 05:55:11,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eac2f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:55:11, skipping insertion in model container [2025-03-09 05:55:11,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:55:01" (2/3) ... [2025-03-09 05:55:11,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eac2f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:55:11, skipping insertion in model container [2025-03-09 05:55:11,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:55:11" (3/3) ... [2025-03-09 05:55:11,405 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-09 05:55:11,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:55:11,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 475 locations, 1 initial locations, 23 loop locations, and 44 error locations. [2025-03-09 05:55:11,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:55:11,480 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;@535004b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:55:11,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-09 05:55:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 475 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 423 states have internal predecessors, (573), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-09 05:55:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:55:11,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:11,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:55:11,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:11,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash 23364031, now seen corresponding path program 1 times [2025-03-09 05:55:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:11,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397395284] [2025-03-09 05:55:11,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:11,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:11,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:11,503 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:55:11,505 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:55:12,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:55:12,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:55:12,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:12,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 05:55:12,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:12,675 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:55:12,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:12,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:12,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397395284] [2025-03-09 05:55:12,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397395284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:12,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:12,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 05:55:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005909320] [2025-03-09 05:55:12,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:12,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 05:55:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:12,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 05:55:12,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 05:55:12,694 INFO L87 Difference]: Start difference. First operand has 475 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 423 states have internal predecessors, (573), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:55:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:12,759 INFO L93 Difference]: Finished difference Result 841 states and 1256 transitions. [2025-03-09 05:55:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 05:55:12,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:55:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:12,770 INFO L225 Difference]: With dead ends: 841 [2025-03-09 05:55:12,772 INFO L226 Difference]: Without dead ends: 354 [2025-03-09 05:55:12,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 05:55:12,784 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:12,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-09 05:55:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-09 05:55:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 301 states have (on average 1.4019933554817277) internal successors, (422), 309 states have internal predecessors, (422), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 489 transitions. [2025-03-09 05:55:12,844 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 489 transitions. Word has length 4 [2025-03-09 05:55:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:12,844 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 489 transitions. [2025-03-09 05:55:12,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:55:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 489 transitions. [2025-03-09 05:55:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 05:55:12,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:12,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 05:55:12,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:55:13,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:13,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:13,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:13,048 INFO L85 PathProgramCache]: Analyzing trace with hash 724285654, now seen corresponding path program 1 times [2025-03-09 05:55:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:13,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832690595] [2025-03-09 05:55:13,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:13,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:13,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:13,055 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:55:13,067 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:55:13,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 05:55:14,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 05:55:14,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:14,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:14,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:55:14,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:14,575 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:55:14,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:14,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:14,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832690595] [2025-03-09 05:55:14,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832690595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:14,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:14,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:14,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141826286] [2025-03-09 05:55:14,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:14,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:14,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:14,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:14,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:14,577 INFO L87 Difference]: Start difference. First operand 354 states and 489 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:55:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:14,901 INFO L93 Difference]: Finished difference Result 706 states and 976 transitions. [2025-03-09 05:55:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-09 05:55:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:14,904 INFO L225 Difference]: With dead ends: 706 [2025-03-09 05:55:14,904 INFO L226 Difference]: Without dead ends: 357 [2025-03-09 05:55:14,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:14,907 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:14,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 969 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:55:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-09 05:55:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-09 05:55:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 304 states have (on average 1.3980263157894737) internal successors, (425), 312 states have internal predecessors, (425), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 492 transitions. [2025-03-09 05:55:14,931 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 492 transitions. Word has length 5 [2025-03-09 05:55:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:14,931 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 492 transitions. [2025-03-09 05:55:14,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:55:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2025-03-09 05:55:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:55:14,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:14,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:55:14,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 05:55:15,132 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 [2025-03-09 05:55:15,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:15,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -721084735, now seen corresponding path program 1 times [2025-03-09 05:55:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:15,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096926634] [2025-03-09 05:55:15,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:15,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:15,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:15,137 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:55:15,138 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:55:15,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:55:16,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:55:16,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:16,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:16,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:55:16,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:16,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:55:17,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:17,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096926634] [2025-03-09 05:55:17,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096926634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:17,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:55:17,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:55:17,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751857258] [2025-03-09 05:55:17,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:17,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:55:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:17,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:55:17,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:55:17,948 INFO L87 Difference]: Start difference. First operand 357 states and 492 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:55:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:18,934 INFO L93 Difference]: Finished difference Result 709 states and 981 transitions. [2025-03-09 05:55:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:55:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:55:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:18,937 INFO L225 Difference]: With dead ends: 709 [2025-03-09 05:55:18,940 INFO L226 Difference]: Without dead ends: 360 [2025-03-09 05:55:18,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:55:18,941 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:18,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1450 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 05:55:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-09 05:55:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2025-03-09 05:55:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 305 states have (on average 1.3934426229508197) internal successors, (425), 312 states have internal predecessors, (425), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 492 transitions. [2025-03-09 05:55:18,960 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 492 transitions. Word has length 8 [2025-03-09 05:55:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:18,960 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 492 transitions. [2025-03-09 05:55:18,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:55:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2025-03-09 05:55:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 05:55:18,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:18,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:18,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:55:19,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:19,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:19,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:19,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1554471313, now seen corresponding path program 1 times [2025-03-09 05:55:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1433241113] [2025-03-09 05:55:19,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:19,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:19,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:19,164 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:55:19,165 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:55:19,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 05:55:20,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 05:55:20,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:20,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:20,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:55:20,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:55:21,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:21,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433241113] [2025-03-09 05:55:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433241113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:21,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:55:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061737440] [2025-03-09 05:55:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:21,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:55:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:21,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:55:21,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:21,366 INFO L87 Difference]: Start difference. First operand 357 states and 492 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:55:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:22,965 INFO L93 Difference]: Finished difference Result 357 states and 492 transitions. [2025-03-09 05:55:22,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:55:22,967 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 16 [2025-03-09 05:55:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:22,969 INFO L225 Difference]: With dead ends: 357 [2025-03-09 05:55:22,969 INFO L226 Difference]: Without dead ends: 355 [2025-03-09 05:55:22,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:55:22,970 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 148 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:22,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1743 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 05:55:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-09 05:55:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-09 05:55:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 305 states have (on average 1.3868852459016394) internal successors, (423), 310 states have internal predecessors, (423), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 490 transitions. [2025-03-09 05:55:22,985 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 490 transitions. Word has length 16 [2025-03-09 05:55:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:22,986 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 490 transitions. [2025-03-09 05:55:22,986 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:55:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 490 transitions. [2025-03-09 05:55:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:55:22,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:22,986 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:23,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 05:55:23,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:23,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:23,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1286049595, now seen corresponding path program 1 times [2025-03-09 05:55:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:23,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1114822676] [2025-03-09 05:55:23,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:23,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:23,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:23,191 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:55:23,192 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:55:23,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:55:24,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:55:24,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:24,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:24,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:55:24,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:55:24,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:24,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:24,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114822676] [2025-03-09 05:55:24,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114822676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:24,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:24,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54534694] [2025-03-09 05:55:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:24,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:24,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:24,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:24,644 INFO L87 Difference]: Start difference. First operand 355 states and 490 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:55:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:25,141 INFO L93 Difference]: Finished difference Result 363 states and 500 transitions. [2025-03-09 05:55:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:25,142 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 22 [2025-03-09 05:55:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:25,144 INFO L225 Difference]: With dead ends: 363 [2025-03-09 05:55:25,144 INFO L226 Difference]: Without dead ends: 362 [2025-03-09 05:55:25,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:25,145 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 4 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:25,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 959 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:55:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-09 05:55:25,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2025-03-09 05:55:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 311 states have (on average 1.3890675241157557) internal successors, (432), 316 states have internal predecessors, (432), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 499 transitions. [2025-03-09 05:55:25,156 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 499 transitions. Word has length 22 [2025-03-09 05:55:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:25,156 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 499 transitions. [2025-03-09 05:55:25,157 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:55:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 499 transitions. [2025-03-09 05:55:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:55:25,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:25,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:25,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:55:25,358 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 [2025-03-09 05:55:25,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:25,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:25,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1286044630, now seen corresponding path program 1 times [2025-03-09 05:55:25,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:25,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905268072] [2025-03-09 05:55:25,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:25,362 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:55:25,363 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:55:25,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:55:26,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:55:26,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:26,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:26,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:55:26,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:55:26,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:26,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:26,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905268072] [2025-03-09 05:55:26,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905268072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:26,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:26,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284405844] [2025-03-09 05:55:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:26,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:26,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:26,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:26,776 INFO L87 Difference]: Start difference. First operand 361 states and 499 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:55:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:27,110 INFO L93 Difference]: Finished difference Result 710 states and 985 transitions. [2025-03-09 05:55:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:27,112 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 22 [2025-03-09 05:55:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:27,116 INFO L225 Difference]: With dead ends: 710 [2025-03-09 05:55:27,116 INFO L226 Difference]: Without dead ends: 367 [2025-03-09 05:55:27,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:27,118 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:27,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 962 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:55:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-09 05:55:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-03-09 05:55:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 317 states have (on average 1.3817034700315458) internal successors, (438), 322 states have internal predecessors, (438), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 505 transitions. [2025-03-09 05:55:27,131 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 505 transitions. Word has length 22 [2025-03-09 05:55:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:27,131 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 505 transitions. [2025-03-09 05:55:27,131 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:55:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 505 transitions. [2025-03-09 05:55:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 05:55:27,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:27,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:27,167 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:55:27,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:27,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:27,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1446615843, now seen corresponding path program 1 times [2025-03-09 05:55:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:27,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247499457] [2025-03-09 05:55:27,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:27,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:27,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:27,335 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:55:27,337 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:55:27,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 05:55:28,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 05:55:28,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:28,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:28,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:55:28,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:55:29,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:55:30,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:30,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247499457] [2025-03-09 05:55:30,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247499457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:30,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:55:30,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:55:30,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410488077] [2025-03-09 05:55:30,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:30,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:55:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:30,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:55:30,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:55:30,282 INFO L87 Difference]: Start difference. First operand 367 states and 505 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:31,551 INFO L93 Difference]: Finished difference Result 720 states and 998 transitions. [2025-03-09 05:55:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:55:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 25 [2025-03-09 05:55:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:31,555 INFO L225 Difference]: With dead ends: 720 [2025-03-09 05:55:31,555 INFO L226 Difference]: Without dead ends: 374 [2025-03-09 05:55:31,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:55:31,556 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:31,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1918 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 05:55:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-09 05:55:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2025-03-09 05:55:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 319 states have (on average 1.3730407523510972) internal successors, (438), 323 states have internal predecessors, (438), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 505 transitions. [2025-03-09 05:55:31,571 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 505 transitions. Word has length 25 [2025-03-09 05:55:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:31,571 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 505 transitions. [2025-03-09 05:55:31,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 505 transitions. [2025-03-09 05:55:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 05:55:31,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:31,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:31,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 05:55:31,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:31,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:31,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1273944762, now seen corresponding path program 1 times [2025-03-09 05:55:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:31,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039452104] [2025-03-09 05:55:31,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:31,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:31,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:31,777 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:55:31,779 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:55:32,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 05:55:32,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 05:55:32,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:32,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:32,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:55:32,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:55:33,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:33,457 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039452104] [2025-03-09 05:55:33,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039452104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:33,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:33,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:55:33,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796685016] [2025-03-09 05:55:33,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:33,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:55:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:33,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:55:33,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:55:33,458 INFO L87 Difference]: Start difference. First operand 368 states and 505 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:55:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:33,864 INFO L93 Difference]: Finished difference Result 375 states and 513 transitions. [2025-03-09 05:55:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:55:33,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-09 05:55:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:33,867 INFO L225 Difference]: With dead ends: 375 [2025-03-09 05:55:33,867 INFO L226 Difference]: Without dead ends: 370 [2025-03-09 05:55:33,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:55:33,868 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:33,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1443 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:55:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-09 05:55:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-09 05:55:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 321 states have (on average 1.3707165109034267) internal successors, (440), 325 states have internal predecessors, (440), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 507 transitions. [2025-03-09 05:55:33,884 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 507 transitions. Word has length 26 [2025-03-09 05:55:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:33,884 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 507 transitions. [2025-03-09 05:55:33,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:55:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 507 transitions. [2025-03-09 05:55:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:55:33,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:33,885 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:55:33,912 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:34,085 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 [2025-03-09 05:55:34,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:34,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash -923818017, now seen corresponding path program 1 times [2025-03-09 05:55:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294977737] [2025-03-09 05:55:34,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:34,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:34,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:34,089 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:34,089 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:34,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:55:35,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:55:35,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:35,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:55:35,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:55:35,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:35,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294977737] [2025-03-09 05:55:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294977737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537945076] [2025-03-09 05:55:35,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:35,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:35,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:35,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:35,449 INFO L87 Difference]: Start difference. First operand 370 states and 507 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:55:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:35,723 INFO L93 Difference]: Finished difference Result 374 states and 511 transitions. [2025-03-09 05:55:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:35,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 05:55:35,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:35,727 INFO L225 Difference]: With dead ends: 374 [2025-03-09 05:55:35,727 INFO L226 Difference]: Without dead ends: 373 [2025-03-09 05:55:35,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:35,727 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:35,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 961 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:55:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-09 05:55:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-09 05:55:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 324 states have (on average 1.367283950617284) internal successors, (443), 328 states have internal predecessors, (443), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 05:55:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 510 transitions. [2025-03-09 05:55:35,736 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 510 transitions. Word has length 30 [2025-03-09 05:55:35,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:35,736 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 510 transitions. [2025-03-09 05:55:35,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:55:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 510 transitions. [2025-03-09 05:55:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 05:55:35,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:35,739 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:55:35,769 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:35,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:35,939 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:35,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash -403197828, now seen corresponding path program 1 times [2025-03-09 05:55:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:35,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1957445581] [2025-03-09 05:55:35,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:35,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:35,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:35,943 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:35,943 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:36,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 05:55:36,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 05:55:36,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:36,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:37,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:55:37,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:55:38,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:38,435 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:55:38,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957445581] [2025-03-09 05:55:38,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957445581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:38,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:38,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:55:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26773983] [2025-03-09 05:55:38,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:38,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:55:38,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:55:38,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:55:38,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:55:38,436 INFO L87 Difference]: Start difference. First operand 373 states and 510 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:55:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:40,231 INFO L93 Difference]: Finished difference Result 389 states and 525 transitions. [2025-03-09 05:55:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:55:40,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-09 05:55:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:40,238 INFO L225 Difference]: With dead ends: 389 [2025-03-09 05:55:40,238 INFO L226 Difference]: Without dead ends: 386 [2025-03-09 05:55:40,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:55:40,238 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 17 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:40,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2392 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 05:55:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-09 05:55:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2025-03-09 05:55:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 335 states have internal predecessors, (451), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-09 05:55:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 520 transitions. [2025-03-09 05:55:40,251 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 520 transitions. Word has length 34 [2025-03-09 05:55:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:40,252 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 520 transitions. [2025-03-09 05:55:40,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:55:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 520 transitions. [2025-03-09 05:55:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 05:55:40,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:40,255 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:55:40,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 05:55:40,455 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 [2025-03-09 05:55:40,455 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-09 05:55:40,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash -403196867, now seen corresponding path program 1 times [2025-03-09 05:55:40,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:55:40,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600259385] [2025-03-09 05:55:40,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:40,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:40,459 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:40,460 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:41,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 05:55:41,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 05:55:41,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:41,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:41,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:55:41,534 INFO L279 TraceCheckSpWp]: Computing forward predicates...