./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/touch-1.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/touch-1.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 7b17d1831b9ff605ca6c7fab07a078cc44dbcf944c26115d18aca71cee657332 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:56:01,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:56:01,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:56:01,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:56:01,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:56:01,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:56:01,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:56:01,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:56:01,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:56:01,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:56:01,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:56:01,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:56:01,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:56:01,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:56:01,754 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:56:01,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:56:01,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:56:01,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:56:01,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:56:01,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:56:01,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:56:01,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:56:01,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:56:01,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:56:01,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:56:01,756 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 -> 7b17d1831b9ff605ca6c7fab07a078cc44dbcf944c26115d18aca71cee657332 [2025-03-09 05:56:01,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:56:02,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:56:02,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:56:02,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:56:02,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:56:02,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/touch-1.i [2025-03-09 05:56:03,216 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c39c12446/813245a7e5174036836ad8d1295696c4/FLAG19aa2ddf8 [2025-03-09 05:56:03,609 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:56:03,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/touch-1.i [2025-03-09 05:56:03,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c39c12446/813245a7e5174036836ad8d1295696c4/FLAG19aa2ddf8 [2025-03-09 05:56:03,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c39c12446/813245a7e5174036836ad8d1295696c4 [2025-03-09 05:56:03,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:56:03,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:56:03,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:56:03,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:56:03,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:56:03,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:56:03" (1/1) ... [2025-03-09 05:56:03,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a14da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:03, skipping insertion in model container [2025-03-09 05:56:03,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:56:03" (1/1) ... [2025-03-09 05:56:03,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:56:04,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:56:04,763 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:56:04,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:56:05,048 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:56:05,053 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:56:05,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05 WrapperNode [2025-03-09 05:56:05,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:56:05,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:56:05,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:56:05,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:56:05,059 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:56:05" (1/1) ... [2025-03-09 05:56:05,099 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:56:05" (1/1) ... [2025-03-09 05:56:05,181 INFO L138 Inliner]: procedures = 669, calls = 1057, calls flagged for inlining = 38, calls inlined = 37, statements flattened = 2966 [2025-03-09 05:56:05,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:56:05,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:56:05,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:56:05,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:56:05,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,209 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:56:05,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:56:05,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:56:05,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:56:05,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:56:05,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (1/1) ... [2025-03-09 05:56:05,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:56:05,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:05,360 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:56:05,365 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:56:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:56:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-09 05:56:05,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:56:05,379 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure utimes [2025-03-09 05:56:05,379 INFO L138 BoogieDeclarations]: Found implementation of procedure utimes [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:56:05,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:56:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:56:05,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:56:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 05:56:05,380 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 05:56:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:56:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:56:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-03-09 05:56:05,380 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-03-09 05:56:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-03-09 05:56:05,380 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-03-09 05:56:05,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-09 05:56:05,380 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-09 05:56:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:56:05,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:56:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:56:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:56:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:56:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-09 05:56:05,381 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-09 05:56:05,381 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-09 05:56:05,382 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-09 05:56:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:56:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 05:56:05,382 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 05:56:05,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:56:05,813 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:56:05,815 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:56:06,093 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3702: havoc #t~ret433#1; [2025-03-09 05:56:12,120 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2748: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-09 05:56:12,120 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3415: call ULTIMATE.dealloc(__main_~#reference_file~0#1.base, __main_~#reference_file~0#1.offset);havoc __main_~#reference_file~0#1.base, __main_~#reference_file~0#1.offset;call ULTIMATE.dealloc(__main_~#date_str~0#1.base, __main_~#date_str~0#1.offset);havoc __main_~#date_str~0#1.base, __main_~#date_str~0#1.offset;call ULTIMATE.dealloc(__main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset);havoc __main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset; [2025-03-09 05:56:12,120 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3752: havoc lutimes_#t~ret476#1; [2025-03-09 05:56:12,120 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2603: call ULTIMATE.dealloc(bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset);havoc bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset; [2025-03-09 05:56:12,121 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3798: havoc getopt_long_#t~ret504#1; [2025-03-09 05:56:12,321 INFO L? ?]: Removed 883 outVars from TransFormulas that were not future-live. [2025-03-09 05:56:12,321 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:56:12,359 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:56:12,361 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:56:12,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:56:12 BoogieIcfgContainer [2025-03-09 05:56:12,362 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:56:12,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:56:12,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:56:12,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:56:12,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:56:03" (1/3) ... [2025-03-09 05:56:12,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b32974e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:56:12, skipping insertion in model container [2025-03-09 05:56:12,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:56:05" (2/3) ... [2025-03-09 05:56:12,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b32974e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:56:12, skipping insertion in model container [2025-03-09 05:56:12,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:56:12" (3/3) ... [2025-03-09 05:56:12,368 INFO L128 eAbstractionObserver]: Analyzing ICFG touch-1.i [2025-03-09 05:56:12,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:56:12,381 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG touch-1.i that has 13 procedures, 746 locations, 1 initial locations, 30 loop locations, and 96 error locations. [2025-03-09 05:56:12,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:56:12,487 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;@1f3ade92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:56:12,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-03-09 05:56:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 746 states, 582 states have (on average 1.6426116838487972) internal successors, (956), 687 states have internal predecessors, (956), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-09 05:56:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:56:12,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:12,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:56:12,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:12,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash 37001343, now seen corresponding path program 1 times [2025-03-09 05:56:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:12,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632529245] [2025-03-09 05:56:12,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:13,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:56:13,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:56:13,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:13,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:14,156 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:56:14,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:14,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632529245] [2025-03-09 05:56:14,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632529245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:14,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:14,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:14,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780234461] [2025-03-09 05:56:14,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:14,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:14,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:14,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:14,199 INFO L87 Difference]: Start difference. First operand has 746 states, 582 states have (on average 1.6426116838487972) internal successors, (956), 687 states have internal predecessors, (956), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) 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:56:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:14,533 INFO L93 Difference]: Finished difference Result 1384 states and 2038 transitions. [2025-03-09 05:56:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:14,535 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:56:14,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:14,544 INFO L225 Difference]: With dead ends: 1384 [2025-03-09 05:56:14,544 INFO L226 Difference]: Without dead ends: 638 [2025-03-09 05:56:14,549 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:56:14,550 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 1 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:14,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1737 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:56:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-09 05:56:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2025-03-09 05:56:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 510 states have (on average 1.5784313725490196) internal successors, (805), 588 states have internal predecessors, (805), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 895 transitions. [2025-03-09 05:56:14,611 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 895 transitions. Word has length 4 [2025-03-09 05:56:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:14,612 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 895 transitions. [2025-03-09 05:56:14,612 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:56:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 895 transitions. [2025-03-09 05:56:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:56:14,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:14,613 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:56:14,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:56:14,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:14,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1498457585, now seen corresponding path program 1 times [2025-03-09 05:56:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024002489] [2025-03-09 05:56:14,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:15,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:56:15,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:56:15,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:15,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:15,757 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:56:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024002489] [2025-03-09 05:56:15,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024002489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685075284] [2025-03-09 05:56:15,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:15,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:15,760 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:56:15,762 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:56:16,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:56:16,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:56:16,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:16,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:16,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1825 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:16,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:17,057 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:56:17,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:56:17,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685075284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:17,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:56:17,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:56:17,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729666995] [2025-03-09 05:56:17,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:17,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:56:17,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:17,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:56:17,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:17,059 INFO L87 Difference]: Start difference. First operand 638 states and 895 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:56:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:17,350 INFO L93 Difference]: Finished difference Result 638 states and 895 transitions. [2025-03-09 05:56:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:56:17,351 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:56:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:17,354 INFO L225 Difference]: With dead ends: 638 [2025-03-09 05:56:17,354 INFO L226 Difference]: Without dead ends: 637 [2025-03-09 05:56:17,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:17,355 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 1 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:17,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1725 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:56:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-09 05:56:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2025-03-09 05:56:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 510 states have (on average 1.576470588235294) internal successors, (804), 587 states have internal predecessors, (804), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 894 transitions. [2025-03-09 05:56:17,372 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 894 transitions. Word has length 7 [2025-03-09 05:56:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:17,372 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 894 transitions. [2025-03-09 05:56:17,373 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:56:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 894 transitions. [2025-03-09 05:56:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:56:17,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:17,376 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:56:17,387 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:56:17,576 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:56:17,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:17,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 792456257, now seen corresponding path program 1 times [2025-03-09 05:56:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600185368] [2025-03-09 05:56:17,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:18,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:56:18,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:56:18,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:18,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:18,445 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:56:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600185368] [2025-03-09 05:56:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600185368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:18,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:18,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:18,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90212704] [2025-03-09 05:56:18,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:18,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:18,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:18,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:18,446 INFO L87 Difference]: Start difference. First operand 637 states and 894 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:56:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:18,740 INFO L93 Difference]: Finished difference Result 637 states and 894 transitions. [2025-03-09 05:56:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:18,741 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:56:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:18,743 INFO L225 Difference]: With dead ends: 637 [2025-03-09 05:56:18,743 INFO L226 Difference]: Without dead ends: 636 [2025-03-09 05:56:18,744 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:56:18,744 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 0 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1726 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.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:18,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1726 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:56:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-09 05:56:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2025-03-09 05:56:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 508 states have (on average 1.5767716535433072) internal successors, (801), 584 states have internal predecessors, (801), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 891 transitions. [2025-03-09 05:56:18,765 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 891 transitions. Word has length 8 [2025-03-09 05:56:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:18,766 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 891 transitions. [2025-03-09 05:56:18,766 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:56:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 891 transitions. [2025-03-09 05:56:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:56:18,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:18,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:18,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:56:18,768 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:18,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1726422959, now seen corresponding path program 1 times [2025-03-09 05:56:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680390783] [2025-03-09 05:56:18,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:19,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:56:19,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:56:19,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:19,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:19,810 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:56:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680390783] [2025-03-09 05:56:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680390783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937637435] [2025-03-09 05:56:19,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:19,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:19,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:19,813 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:56:19,815 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:56:20,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:56:20,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:56:20,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:20,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:20,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:56:20,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:20,942 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:56:20,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:56:20,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937637435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:20,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:56:20,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:56:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907782694] [2025-03-09 05:56:20,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:20,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:20,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:20,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:20,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:20,944 INFO L87 Difference]: Start difference. First operand 634 states and 891 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:56:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:21,162 INFO L93 Difference]: Finished difference Result 634 states and 891 transitions. [2025-03-09 05:56:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:21,162 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:56:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:21,165 INFO L225 Difference]: With dead ends: 634 [2025-03-09 05:56:21,165 INFO L226 Difference]: Without dead ends: 632 [2025-03-09 05:56:21,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:21,166 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 728 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:21,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 974 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:56:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-09 05:56:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2025-03-09 05:56:21,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 508 states have (on average 1.5728346456692914) internal successors, (799), 582 states have internal predecessors, (799), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 889 transitions. [2025-03-09 05:56:21,190 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 889 transitions. Word has length 12 [2025-03-09 05:56:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:21,191 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 889 transitions. [2025-03-09 05:56:21,191 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:56:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 889 transitions. [2025-03-09 05:56:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:56:21,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:21,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:21,201 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:56:21,392 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:56:21,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:21,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:21,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1979503047, now seen corresponding path program 1 times [2025-03-09 05:56:21,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:21,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991673836] [2025-03-09 05:56:21,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:21,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:22,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:56:22,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:56:22,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:22,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:22,322 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:56:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991673836] [2025-03-09 05:56:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991673836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509217047] [2025-03-09 05:56:22,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:22,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:22,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:22,326 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:56:22,327 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:56:23,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:56:23,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:56:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:23,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:23,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1843 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:23,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:23,484 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:56:23,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:23,584 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:56:23,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509217047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:56:23,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:56:23,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:56:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365707545] [2025-03-09 05:56:23,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:56:23,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:56:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:23,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:56:23,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:23,585 INFO L87 Difference]: Start difference. First operand 632 states and 889 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:56:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:24,123 INFO L93 Difference]: Finished difference Result 1267 states and 1783 transitions. [2025-03-09 05:56:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:56:24,124 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:56:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:24,127 INFO L225 Difference]: With dead ends: 1267 [2025-03-09 05:56:24,127 INFO L226 Difference]: Without dead ends: 641 [2025-03-09 05:56:24,129 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:56:24,130 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:24,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3442 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:56:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-03-09 05:56:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-03-09 05:56:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 517 states have (on average 1.562862669245648) internal successors, (808), 591 states have internal predecessors, (808), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 898 transitions. [2025-03-09 05:56:24,155 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 898 transitions. Word has length 13 [2025-03-09 05:56:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:24,155 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 898 transitions. [2025-03-09 05:56:24,156 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:56:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 898 transitions. [2025-03-09 05:56:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:56:24,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:24,157 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:24,167 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:56:24,357 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:56:24,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:24,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash 940442793, now seen corresponding path program 2 times [2025-03-09 05:56:24,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:24,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830080332] [2025-03-09 05:56:24,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:56:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:25,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:56:25,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:56:25,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:56:25,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:25,458 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:56:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830080332] [2025-03-09 05:56:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830080332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:25,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:25,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:56:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937093570] [2025-03-09 05:56:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:25,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:56:25,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:25,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:56:25,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:25,459 INFO L87 Difference]: Start difference. First operand 641 states and 898 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:56:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:26,457 INFO L93 Difference]: Finished difference Result 641 states and 898 transitions. [2025-03-09 05:56:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:56:26,458 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:56:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:26,461 INFO L225 Difference]: With dead ends: 641 [2025-03-09 05:56:26,461 INFO L226 Difference]: Without dead ends: 639 [2025-03-09 05:56:26,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:26,462 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 727 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:26,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 2567 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 05:56:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-03-09 05:56:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-03-09 05:56:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 517 states have (on average 1.5589941972920696) internal successors, (806), 589 states have internal predecessors, (806), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 896 transitions. [2025-03-09 05:56:26,479 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 896 transitions. Word has length 22 [2025-03-09 05:56:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:26,479 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 896 transitions. [2025-03-09 05:56:26,479 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:56:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 896 transitions. [2025-03-09 05:56:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:56:26,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:26,480 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:56:26,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:56:26,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:26,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:26,481 INFO L85 PathProgramCache]: Analyzing trace with hash -727715108, now seen corresponding path program 1 times [2025-03-09 05:56:26,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:26,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72350511] [2025-03-09 05:56:26,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:27,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:56:27,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:56:27,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:27,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:27,281 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:56:27,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:27,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72350511] [2025-03-09 05:56:27,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72350511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:27,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:27,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:27,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452957853] [2025-03-09 05:56:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:27,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:27,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:27,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:27,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:27,282 INFO L87 Difference]: Start difference. First operand 639 states and 896 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:27,564 INFO L93 Difference]: Finished difference Result 1261 states and 1776 transitions. [2025-03-09 05:56:27,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:27,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 05:56:27,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:27,568 INFO L225 Difference]: With dead ends: 1261 [2025-03-09 05:56:27,568 INFO L226 Difference]: Without dead ends: 642 [2025-03-09 05:56:27,570 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:56:27,570 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 1 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:27,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1715 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:56:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-09 05:56:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2025-03-09 05:56:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 520 states have (on average 1.5557692307692308) internal successors, (809), 592 states have internal predecessors, (809), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 899 transitions. [2025-03-09 05:56:27,604 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 899 transitions. Word has length 27 [2025-03-09 05:56:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:27,604 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 899 transitions. [2025-03-09 05:56:27,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 899 transitions. [2025-03-09 05:56:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 05:56:27,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:27,606 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:27,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:56:27,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:27,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1084670365, now seen corresponding path program 1 times [2025-03-09 05:56:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:27,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830952972] [2025-03-09 05:56:27,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:28,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:56:28,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:56:28,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:28,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:28,467 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:56:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:28,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830952972] [2025-03-09 05:56:28,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830952972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:28,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:28,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596115536] [2025-03-09 05:56:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:28,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:28,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:28,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:28,469 INFO L87 Difference]: Start difference. First operand 642 states and 899 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:56:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:28,868 INFO L93 Difference]: Finished difference Result 940 states and 1338 transitions. [2025-03-09 05:56:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-09 05:56:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:28,873 INFO L225 Difference]: With dead ends: 940 [2025-03-09 05:56:28,873 INFO L226 Difference]: Without dead ends: 938 [2025-03-09 05:56:28,874 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:56:28,874 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 411 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:28,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1702 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:56:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-09 05:56:28,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 646. [2025-03-09 05:56:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 524 states have (on average 1.5534351145038168) internal successors, (814), 596 states have internal predecessors, (814), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 904 transitions. [2025-03-09 05:56:28,893 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 904 transitions. Word has length 28 [2025-03-09 05:56:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:28,893 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 904 transitions. [2025-03-09 05:56:28,893 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:56:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 904 transitions. [2025-03-09 05:56:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:56:28,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:28,894 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:56:28,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:56:28,894 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:28,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1635240066, now seen corresponding path program 1 times [2025-03-09 05:56:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:28,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717811991] [2025-03-09 05:56:28,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:29,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:56:29,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:56:29,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:29,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:29,882 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:56:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717811991] [2025-03-09 05:56:29,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717811991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481317904] [2025-03-09 05:56:29,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:29,885 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:56:29,886 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:56:30,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:56:31,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:56:31,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:31,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:31,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:56:31,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:31,382 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:56:31,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:31,788 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:56:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481317904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:56:31,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:56:31,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:56:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937115977] [2025-03-09 05:56:31,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:56:31,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:56:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:31,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:56:31,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:56:31,790 INFO L87 Difference]: Start difference. First operand 646 states and 904 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:56:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:32,708 INFO L93 Difference]: Finished difference Result 1294 states and 1816 transitions. [2025-03-09 05:56:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:56:32,709 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:56:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:32,711 INFO L225 Difference]: With dead ends: 1294 [2025-03-09 05:56:32,712 INFO L226 Difference]: Without dead ends: 663 [2025-03-09 05:56:32,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:56:32,713 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 5 mSDsluCounter, 4260 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5114 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:32,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5114 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 05:56:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-03-09 05:56:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2025-03-09 05:56:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 542 states have (on average 1.533210332103321) internal successors, (831), 613 states have internal predecessors, (831), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 921 transitions. [2025-03-09 05:56:32,727 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 921 transitions. Word has length 30 [2025-03-09 05:56:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:32,727 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 921 transitions. [2025-03-09 05:56:32,727 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:56:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 921 transitions. [2025-03-09 05:56:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 05:56:32,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:32,729 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:32,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:56:32,929 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:56:32,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -393655838, now seen corresponding path program 1 times [2025-03-09 05:56:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926155662] [2025-03-09 05:56:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:33,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 05:56:33,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 05:56:33,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:33,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:56:33,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:33,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926155662] [2025-03-09 05:56:33,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926155662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:33,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:33,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:33,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798742640] [2025-03-09 05:56:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:33,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:33,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:33,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:33,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:33,744 INFO L87 Difference]: Start difference. First operand 663 states and 921 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:56:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:34,089 INFO L93 Difference]: Finished difference Result 675 states and 935 transitions. [2025-03-09 05:56:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:34,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-09 05:56:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:34,092 INFO L225 Difference]: With dead ends: 675 [2025-03-09 05:56:34,092 INFO L226 Difference]: Without dead ends: 673 [2025-03-09 05:56:34,093 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:56:34,093 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 2 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:34,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1710 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:56:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-09 05:56:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 672. [2025-03-09 05:56:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 551 states have (on average 1.52994555353902) internal successors, (843), 622 states have internal predecessors, (843), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 933 transitions. [2025-03-09 05:56:34,113 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 933 transitions. Word has length 48 [2025-03-09 05:56:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:34,113 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 933 transitions. [2025-03-09 05:56:34,113 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:56:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 933 transitions. [2025-03-09 05:56:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:56:34,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:34,116 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:56:34,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 05:56:34,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:34,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash 681576990, now seen corresponding path program 1 times [2025-03-09 05:56:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:34,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060840572] [2025-03-09 05:56:34,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:34,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:56:34,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:56:34,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:34,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:34,861 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:56:34,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:34,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060840572] [2025-03-09 05:56:34,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060840572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:34,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:34,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247565826] [2025-03-09 05:56:34,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:34,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:34,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:34,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:34,864 INFO L87 Difference]: Start difference. First operand 672 states and 933 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:56:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:35,098 INFO L93 Difference]: Finished difference Result 672 states and 933 transitions. [2025-03-09 05:56:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:35,098 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:56:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:35,100 INFO L225 Difference]: With dead ends: 672 [2025-03-09 05:56:35,100 INFO L226 Difference]: Without dead ends: 671 [2025-03-09 05:56:35,101 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:56:35,101 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 0 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:35,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1713 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:56:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-09 05:56:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 667. [2025-03-09 05:56:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 547 states have (on average 1.530164533820841) internal successors, (837), 617 states have internal predecessors, (837), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 927 transitions. [2025-03-09 05:56:35,113 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 927 transitions. Word has length 49 [2025-03-09 05:56:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:35,114 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 927 transitions. [2025-03-09 05:56:35,114 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:56:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 927 transitions. [2025-03-09 05:56:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:56:35,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:35,115 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:35,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:56:35,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:35,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash -457313689, now seen corresponding path program 1 times [2025-03-09 05:56:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:35,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294855946] [2025-03-09 05:56:35,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:35,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:35,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:56:35,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:56:35,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:35,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:36,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:36,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294855946] [2025-03-09 05:56:36,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294855946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:36,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650950081] [2025-03-09 05:56:36,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:36,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:36,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:36,099 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:56:36,104 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:56:37,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:56:37,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:56:37,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:37,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:37,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 2233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:37,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:37,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:56:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650950081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:56:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:56:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935485708] [2025-03-09 05:56:37,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:37,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:56:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:37,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:56:37,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:37,498 INFO L87 Difference]: Start difference. First operand 667 states and 927 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:37,989 INFO L93 Difference]: Finished difference Result 963 states and 1365 transitions. [2025-03-09 05:56:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:56:37,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-09 05:56:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:37,992 INFO L225 Difference]: With dead ends: 963 [2025-03-09 05:56:37,992 INFO L226 Difference]: Without dead ends: 962 [2025-03-09 05:56:37,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:56:37,993 INFO L435 NwaCegarLoop]: 1260 mSDtfsCounter, 821 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 2571 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:37,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 2571 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:56:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-09 05:56:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 666. [2025-03-09 05:56:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 547 states have (on average 1.5283363802559415) internal successors, (836), 616 states have internal predecessors, (836), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 926 transitions. [2025-03-09 05:56:38,006 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 926 transitions. Word has length 50 [2025-03-09 05:56:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:38,006 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 926 transitions. [2025-03-09 05:56:38,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 926 transitions. [2025-03-09 05:56:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 05:56:38,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:38,007 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:38,022 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:56:38,207 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:56:38,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1291821365, now seen corresponding path program 1 times [2025-03-09 05:56:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922891677] [2025-03-09 05:56:38,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:38,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:38,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:56:38,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:56:38,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922891677] [2025-03-09 05:56:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922891677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:39,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353487313] [2025-03-09 05:56:39,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:39,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:39,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:39,057 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:56:39,059 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:56:40,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:56:40,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:56:40,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:40,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:40,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 2234 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:40,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:40,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:56:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353487313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:56:40,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:56:40,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:56:40,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526878475] [2025-03-09 05:56:40,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:56:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:56:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:40,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:56:40,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:40,563 INFO L87 Difference]: Start difference. First operand 666 states and 926 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:41,364 INFO L93 Difference]: Finished difference Result 1847 states and 2672 transitions. [2025-03-09 05:56:41,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:56:41,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 05:56:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:41,373 INFO L225 Difference]: With dead ends: 1847 [2025-03-09 05:56:41,374 INFO L226 Difference]: Without dead ends: 1846 [2025-03-09 05:56:41,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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:56:41,375 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 2868 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:41,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 3328 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 05:56:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2025-03-09 05:56:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 678. [2025-03-09 05:56:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 559 states have (on average 1.522361359570662) internal successors, (851), 628 states have internal predecessors, (851), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 941 transitions. [2025-03-09 05:56:41,399 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 941 transitions. Word has length 51 [2025-03-09 05:56:41,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:41,400 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 941 transitions. [2025-03-09 05:56:41,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 941 transitions. [2025-03-09 05:56:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:56:41,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:41,401 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:56:41,414 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:56:41,601 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:56:41,601 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:41,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:41,602 INFO L85 PathProgramCache]: Analyzing trace with hash 744123828, now seen corresponding path program 1 times [2025-03-09 05:56:41,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:41,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845971141] [2025-03-09 05:56:41,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:42,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:56:42,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:56:42,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:42,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:42,531 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:56:42,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:42,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845971141] [2025-03-09 05:56:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845971141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:42,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019734290] [2025-03-09 05:56:42,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:42,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:42,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:42,533 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:56:42,534 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:56:43,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:56:43,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:56:43,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:43,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:43,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 2197 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:56:43,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:56:43,959 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:56:43,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:56:44,060 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:56:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019734290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:56:44,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:56:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:56:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459139380] [2025-03-09 05:56:44,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:56:44,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:56:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:44,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:56:44,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:56:44,061 INFO L87 Difference]: Start difference. First operand 678 states and 941 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:56:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:44,538 INFO L93 Difference]: Finished difference Result 1331 states and 1859 transitions. [2025-03-09 05:56:44,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:56:44,538 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:56:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:44,540 INFO L225 Difference]: With dead ends: 1331 [2025-03-09 05:56:44,541 INFO L226 Difference]: Without dead ends: 696 [2025-03-09 05:56:44,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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:56:44,542 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 4 mSDsluCounter, 3416 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4273 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:44,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4273 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:56:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-09 05:56:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2025-03-09 05:56:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 577 states have (on average 1.5060658578856152) internal successors, (869), 646 states have internal predecessors, (869), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 05:56:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 959 transitions. [2025-03-09 05:56:44,555 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 959 transitions. Word has length 55 [2025-03-09 05:56:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:44,555 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 959 transitions. [2025-03-09 05:56:44,555 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:56:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 959 transitions. [2025-03-09 05:56:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 05:56:44,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:44,556 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:44,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 05:56:44,756 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:56:44,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:44,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1731314069, now seen corresponding path program 1 times [2025-03-09 05:56:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614912051] [2025-03-09 05:56:44,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:45,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 05:56:45,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 05:56:45,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:45,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:45,576 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:56:45,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:45,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614912051] [2025-03-09 05:56:45,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614912051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:45,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:45,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486561113] [2025-03-09 05:56:45,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:45,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:45,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:45,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:45,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:45,577 INFO L87 Difference]: Start difference. First operand 696 states and 959 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:56:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:46,041 INFO L93 Difference]: Finished difference Result 1387 states and 1944 transitions. [2025-03-09 05:56:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:46,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-03-09 05:56:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:46,044 INFO L225 Difference]: With dead ends: 1387 [2025-03-09 05:56:46,044 INFO L226 Difference]: Without dead ends: 791 [2025-03-09 05:56:46,045 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:56:46,045 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 119 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:46,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1638 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:56:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-09 05:56:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 738. [2025-03-09 05:56:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 618 states have (on average 1.4967637540453074) internal successors, (925), 687 states have internal predecessors, (925), 52 states have call successors, (52), 12 states have call predecessors, (52), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-09 05:56:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1017 transitions. [2025-03-09 05:56:46,063 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1017 transitions. Word has length 60 [2025-03-09 05:56:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:46,063 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1017 transitions. [2025-03-09 05:56:46,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:56:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1017 transitions. [2025-03-09 05:56:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 05:56:46,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:46,064 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:46,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 05:56:46,064 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:46,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1640442135, now seen corresponding path program 1 times [2025-03-09 05:56:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:46,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654956247] [2025-03-09 05:56:46,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:56:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:46,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:56:46,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:56:46,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:56:46,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:46,889 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:56:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654956247] [2025-03-09 05:56:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654956247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:46,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:56:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164855449] [2025-03-09 05:56:46,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:46,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:56:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:46,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:56:46,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:56:46,891 INFO L87 Difference]: Start difference. First operand 738 states and 1017 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:56:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:47,143 INFO L93 Difference]: Finished difference Result 740 states and 1017 transitions. [2025-03-09 05:56:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:56:47,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-03-09 05:56:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:47,146 INFO L225 Difference]: With dead ends: 740 [2025-03-09 05:56:47,146 INFO L226 Difference]: Without dead ends: 738 [2025-03-09 05:56:47,146 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:56:47,146 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 1 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:47,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1711 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:56:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-09 05:56:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2025-03-09 05:56:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 618 states have (on average 1.493527508090615) internal successors, (923), 687 states have internal predecessors, (923), 52 states have call successors, (52), 12 states have call predecessors, (52), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-09 05:56:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1015 transitions. [2025-03-09 05:56:47,160 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1015 transitions. Word has length 62 [2025-03-09 05:56:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:47,160 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1015 transitions. [2025-03-09 05:56:47,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:56:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1015 transitions. [2025-03-09 05:56:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:56:47,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:47,161 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:47,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 05:56:47,161 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:47,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1944496577, now seen corresponding path program 2 times [2025-03-09 05:56:47,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:47,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628172422] [2025-03-09 05:56:47,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:56:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:47,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-09 05:56:47,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-03-09 05:56:47,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:56:47,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-09 05:56:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628172422] [2025-03-09 05:56:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628172422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:56:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:56:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:56:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714337534] [2025-03-09 05:56:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:56:48,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:56:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:56:48,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:56:48,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:56:48,364 INFO L87 Difference]: Start difference. First operand 738 states and 1015 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:56:49,568 INFO L93 Difference]: Finished difference Result 1404 states and 1952 transitions. [2025-03-09 05:56:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:56:49,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-09 05:56:49,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:56:49,572 INFO L225 Difference]: With dead ends: 1404 [2025-03-09 05:56:49,572 INFO L226 Difference]: Without dead ends: 738 [2025-03-09 05:56:49,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:56:49,573 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 728 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:56:49,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 3355 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 05:56:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-09 05:56:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2025-03-09 05:56:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 618 states have (on average 1.4919093851132685) internal successors, (922), 687 states have internal predecessors, (922), 52 states have call successors, (52), 12 states have call predecessors, (52), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-09 05:56:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1014 transitions. [2025-03-09 05:56:49,589 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1014 transitions. Word has length 63 [2025-03-09 05:56:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:56:49,590 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1014 transitions. [2025-03-09 05:56:49,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:56:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1014 transitions. [2025-03-09 05:56:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 05:56:49,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:56:49,591 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:56:49,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 05:56:49,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-09 05:56:49,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:56:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 415900676, now seen corresponding path program 2 times [2025-03-09 05:56:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:56:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878416772] [2025-03-09 05:56:49,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:56:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:56:50,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:56:50,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:56:50,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:56:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:56:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-09 05:56:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:56:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878416772] [2025-03-09 05:56:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878416772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:56:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783045517] [2025-03-09 05:56:50,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:56:50,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:56:50,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:56:50,535 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:56:50,537 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:56:51,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.