./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/touch-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7b17d1831b9ff605ca6c7fab07a078cc44dbcf944c26115d18aca71cee657332 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:02:55,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:02:55,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 18:02:55,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:02:55,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:02:55,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:02:55,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:02:55,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:02:55,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:02:55,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:02:55,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:02:55,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:02:55,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:02:55,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:02:55,944 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:02:55,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:02:55,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:02:55,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:02:55,945 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:02:55,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:02:55,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:02:55,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:02:55,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:02:55,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:02:55,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:02:55,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:02:55,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:02:55,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:02:55,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:02:55,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:02:55,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:02:55,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:02:55,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:02:55,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:02:55,947 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7b17d1831b9ff605ca6c7fab07a078cc44dbcf944c26115d18aca71cee657332 [2025-02-06 18:02:56,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:02:56,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:02:56,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:02:56,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:02:56,165 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:02:56,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/touch-1.i [2025-02-06 18:02:57,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/034672742/9f02c8287d1b4bc9a38eb91c019faa04/FLAG9e1d9ea99 [2025-02-06 18:02:57,833 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:02:57,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/touch-1.i [2025-02-06 18:02:57,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/034672742/9f02c8287d1b4bc9a38eb91c019faa04/FLAG9e1d9ea99 [2025-02-06 18:02:57,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/034672742/9f02c8287d1b4bc9a38eb91c019faa04 [2025-02-06 18:02:57,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:02:57,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:02:57,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:02:57,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:02:57,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:02:57,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:02:57" (1/1) ... [2025-02-06 18:02:57,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a54ccf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:57, skipping insertion in model container [2025-02-06 18:02:57,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:02:57" (1/1) ... [2025-02-06 18:02:57,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:02:58,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:02:58,920 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:02:59,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:02:59,261 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:02:59,268 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:02:59,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59 WrapperNode [2025-02-06 18:02:59,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:02:59,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:02:59,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:02:59,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:02:59,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,430 INFO L138 Inliner]: procedures = 669, calls = 1057, calls flagged for inlining = 38, calls inlined = 37, statements flattened = 2966 [2025-02-06 18:02:59,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:02:59,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:02:59,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:02:59,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:02:59,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,469 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:02:59,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:02:59,543 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:02:59,543 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:02:59,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:02:59,544 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (1/1) ... [2025-02-06 18:02:59,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:02:59,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:02:59,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:02:59,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:02:59,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:02:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-06 18:02:59,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-06 18:02:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 18:02:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-06 18:02:59,594 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-06 18:02:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 18:02:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 18:02:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:02:59,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure utimes [2025-02-06 18:02:59,595 INFO L138 BoogieDeclarations]: Found implementation of procedure utimes [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:02:59,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:02:59,595 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-06 18:02:59,595 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-02-06 18:02:59,595 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-02-06 18:02:59,595 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-02-06 18:02:59,595 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-06 18:02:59,596 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:02:59,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-06 18:02:59,596 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-06 18:02:59,596 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 18:02:59,596 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 18:02:59,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 18:03:00,005 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:03:00,007 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:03:00,311 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3702: havoc #t~ret433#1; [2025-02-06 18:03:06,134 INFO L1309 $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-02-06 18:03:06,135 INFO L1309 $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-02-06 18:03:06,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3752: havoc lutimes_#t~ret476#1; [2025-02-06 18:03:06,135 INFO L1309 $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-02-06 18:03:06,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3798: havoc getopt_long_#t~ret504#1; [2025-02-06 18:03:06,361 INFO L? ?]: Removed 883 outVars from TransFormulas that were not future-live. [2025-02-06 18:03:06,361 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:03:06,389 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:03:06,389 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:03:06,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:03:06 BoogieIcfgContainer [2025-02-06 18:03:06,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:03:06,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:03:06,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:03:06,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:03:06,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:02:57" (1/3) ... [2025-02-06 18:03:06,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9a5f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:03:06, skipping insertion in model container [2025-02-06 18:03:06,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:02:59" (2/3) ... [2025-02-06 18:03:06,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9a5f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:03:06, skipping insertion in model container [2025-02-06 18:03:06,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:03:06" (3/3) ... [2025-02-06 18:03:06,396 INFO L128 eAbstractionObserver]: Analyzing ICFG touch-1.i [2025-02-06 18:03:06,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:03:06,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG touch-1.i that has 13 procedures, 749 locations, 1 initial locations, 30 loop locations, and 96 error locations. [2025-02-06 18:03:06,446 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:03:06,453 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;@1568f9f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:03:06,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-02-06 18:03:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 749 states, 585 states have (on average 1.6393162393162393) internal successors, (959), 690 states have internal predecessors, (959), 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-02-06 18:03:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:03:06,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:06,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:03:06,461 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-02-06 18:03:06,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash 37093695, now seen corresponding path program 1 times [2025-02-06 18:03:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:06,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196939267] [2025-02-06 18:03:06,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:07,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:03:07,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:03:07,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:07,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:03:07,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:07,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196939267] [2025-02-06 18:03:07,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196939267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:07,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:07,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:03:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469224839] [2025-02-06 18:03:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:07,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:07,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:07,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:07,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:07,987 INFO L87 Difference]: Start difference. First operand has 749 states, 585 states have (on average 1.6393162393162393) internal successors, (959), 690 states have internal predecessors, (959), 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-02-06 18:03:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:08,392 INFO L93 Difference]: Finished difference Result 1389 states and 2043 transitions. [2025-02-06 18:03:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:08,394 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-02-06 18:03:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:08,407 INFO L225 Difference]: With dead ends: 1389 [2025-02-06 18:03:08,409 INFO L226 Difference]: Without dead ends: 640 [2025-02-06 18:03:08,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:08,418 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 1 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1741 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-02-06 18:03:08,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1741 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:03:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-02-06 18:03:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2025-02-06 18:03:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 512 states have (on average 1.576171875) internal successors, (807), 590 states have internal predecessors, (807), 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-02-06 18:03:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 897 transitions. [2025-02-06 18:03:08,495 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 897 transitions. Word has length 4 [2025-02-06 18:03:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:08,496 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 897 transitions. [2025-02-06 18:03:08,496 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-02-06 18:03:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 897 transitions. [2025-02-06 18:03:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:03:08,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:08,496 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:03:08,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:03:08,497 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-02-06 18:03:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1252803826, now seen corresponding path program 1 times [2025-02-06 18:03:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:08,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561706666] [2025-02-06 18:03:08,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:09,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:03:09,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:03:09,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:09,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:03:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561706666] [2025-02-06 18:03:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561706666] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:03:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434241276] [2025-02-06 18:03:09,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:09,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:09,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:03:09,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:03:09,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:03:10,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:03:10,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:03:10,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:10,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:10,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 1825 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:03:10,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:03:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:03:11,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:03:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434241276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:11,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:03:11,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:03:11,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611410048] [2025-02-06 18:03:11,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:11,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:03:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:11,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:03:11,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:03:11,039 INFO L87 Difference]: Start difference. First operand 640 states and 897 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-02-06 18:03:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:11,399 INFO L93 Difference]: Finished difference Result 640 states and 897 transitions. [2025-02-06 18:03:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:03:11,399 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-02-06 18:03:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:11,402 INFO L225 Difference]: With dead ends: 640 [2025-02-06 18:03:11,402 INFO L226 Difference]: Without dead ends: 639 [2025-02-06 18:03:11,403 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-02-06 18:03:11,403 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 1 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1729 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-02-06 18:03:11,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1729 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:03:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-06 18:03:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-02-06 18:03:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 512 states have (on average 1.57421875) 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-02-06 18:03:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 896 transitions. [2025-02-06 18:03:11,421 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 896 transitions. Word has length 7 [2025-02-06 18:03:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:11,421 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 896 transitions. [2025-02-06 18:03:11,421 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-02-06 18:03:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 896 transitions. [2025-02-06 18:03:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:03:11,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:11,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:03:11,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:03:11,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:11,623 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-02-06 18:03:11,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash 182214081, now seen corresponding path program 1 times [2025-02-06 18:03:11,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:11,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445662577] [2025-02-06 18:03:11,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:11,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:12,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:03:12,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:03:12,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:12,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:03:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:12,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445662577] [2025-02-06 18:03:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445662577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:12,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:03:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824168262] [2025-02-06 18:03:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:12,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:12,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:12,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:12,432 INFO L87 Difference]: Start difference. First operand 639 states and 896 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-02-06 18:03:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:12,699 INFO L93 Difference]: Finished difference Result 639 states and 896 transitions. [2025-02-06 18:03:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:12,699 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-02-06 18:03:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:12,702 INFO L225 Difference]: With dead ends: 639 [2025-02-06 18:03:12,702 INFO L226 Difference]: Without dead ends: 638 [2025-02-06 18:03:12,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:12,703 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 0 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1730 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:03:12,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1730 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:03:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-06 18:03:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2025-02-06 18:03:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 510 states have (on average 1.5745098039215686) internal successors, (803), 586 states have internal predecessors, (803), 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-02-06 18:03:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 893 transitions. [2025-02-06 18:03:12,718 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 893 transitions. Word has length 8 [2025-02-06 18:03:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:12,718 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 893 transitions. [2025-02-06 18:03:12,718 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-02-06 18:03:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 893 transitions. [2025-02-06 18:03:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 18:03:12,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:12,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:03:12,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:03:12,719 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-02-06 18:03:12,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash -470135890, now seen corresponding path program 1 times [2025-02-06 18:03:12,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:12,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872643763] [2025-02-06 18:03:12,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:13,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:03:13,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:03:13,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:13,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:03:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872643763] [2025-02-06 18:03:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872643763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:03:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205032148] [2025-02-06 18:03:13,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:13,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:13,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:03:13,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:03:13,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:03:14,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:03:15,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:03:15,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:03:15,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:03:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:03:15,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:03:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205032148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:15,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:03:15,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 18:03:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654822994] [2025-02-06 18:03:15,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:15,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:15,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:15,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:15,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:03:15,150 INFO L87 Difference]: Start difference. First operand 636 states and 893 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-02-06 18:03:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:15,397 INFO L93 Difference]: Finished difference Result 636 states and 893 transitions. [2025-02-06 18:03:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:15,397 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-02-06 18:03:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:15,400 INFO L225 Difference]: With dead ends: 636 [2025-02-06 18:03:15,400 INFO L226 Difference]: Without dead ends: 634 [2025-02-06 18:03:15,401 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-02-06 18:03:15,401 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 729 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 977 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-02-06 18:03:15,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 977 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:03:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-02-06 18:03:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2025-02-06 18:03:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 510 states have (on average 1.5705882352941176) 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-02-06 18:03:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 891 transitions. [2025-02-06 18:03:15,420 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 891 transitions. Word has length 12 [2025-02-06 18:03:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:15,422 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 891 transitions. [2025-02-06 18:03:15,422 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-02-06 18:03:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 891 transitions. [2025-02-06 18:03:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 18:03:15,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:15,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:03:15,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:03:15,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:15,629 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-02-06 18:03:15,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:15,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1689309569, now seen corresponding path program 1 times [2025-02-06 18:03:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:15,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134277161] [2025-02-06 18:03:15,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:16,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:03:16,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:03:16,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:16,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:03:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134277161] [2025-02-06 18:03:16,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134277161] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:03:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728881086] [2025-02-06 18:03:16,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:16,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:16,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:03:16,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:03:16,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:03:17,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:03:17,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:03:17,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:17,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:17,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1843 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:03:17,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:03:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:03:17,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:03:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:03:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728881086] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:03:17,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:03:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:03:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204470264] [2025-02-06 18:03:17,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:03:17,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:03:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:17,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:03:17,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:03:17,852 INFO L87 Difference]: Start difference. First operand 634 states and 891 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-02-06 18:03:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:18,360 INFO L93 Difference]: Finished difference Result 1271 states and 1787 transitions. [2025-02-06 18:03:18,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:03:18,360 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-02-06 18:03:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:18,363 INFO L225 Difference]: With dead ends: 1271 [2025-02-06 18:03:18,363 INFO L226 Difference]: Without dead ends: 643 [2025-02-06 18:03:18,364 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-02-06 18:03:18,365 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 4 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:03:18,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2588 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 18:03:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-02-06 18:03:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2025-02-06 18:03:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 519 states have (on average 1.560693641618497) internal successors, (810), 593 states have internal predecessors, (810), 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-02-06 18:03:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 900 transitions. [2025-02-06 18:03:18,381 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 900 transitions. Word has length 13 [2025-02-06 18:03:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:18,381 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 900 transitions. [2025-02-06 18:03:18,382 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-02-06 18:03:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 900 transitions. [2025-02-06 18:03:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:03:18,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:18,382 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:03:18,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:03:18,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:18,588 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-02-06 18:03:18,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1171311796, now seen corresponding path program 2 times [2025-02-06 18:03:18,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:18,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293740744] [2025-02-06 18:03:18,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:03:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:19,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 18:03:19,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 18:03:19,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:03:19,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:03:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:19,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293740744] [2025-02-06 18:03:19,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293740744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:19,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:19,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:03:19,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053543896] [2025-02-06 18:03:19,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:19,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:03:19,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:19,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:03:19,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:03:19,704 INFO L87 Difference]: Start difference. First operand 643 states and 900 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-02-06 18:03:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:20,883 INFO L93 Difference]: Finished difference Result 643 states and 900 transitions. [2025-02-06 18:03:20,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:03:20,884 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-02-06 18:03:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:20,888 INFO L225 Difference]: With dead ends: 643 [2025-02-06 18:03:20,890 INFO L226 Difference]: Without dead ends: 641 [2025-02-06 18:03:20,891 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-02-06 18:03:20,891 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 728 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 2574 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:03:20,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 2574 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 18:03:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-02-06 18:03:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-02-06 18:03:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 519 states have (on average 1.556840077071291) 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-02-06 18:03:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 898 transitions. [2025-02-06 18:03:20,916 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 898 transitions. Word has length 22 [2025-02-06 18:03:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:20,916 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 898 transitions. [2025-02-06 18:03:20,916 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-02-06 18:03:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 898 transitions. [2025-02-06 18:03:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 18:03:20,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:20,917 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:03:20,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:03:20,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-06 18:03:20,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash 341647548, now seen corresponding path program 1 times [2025-02-06 18:03:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:20,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209350655] [2025-02-06 18:03:20,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:21,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 18:03:21,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 18:03:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:03:21,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:21,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209350655] [2025-02-06 18:03:21,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209350655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:21,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:21,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:03:21,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258913694] [2025-02-06 18:03:21,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:21,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:21,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:21,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:21,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:21,917 INFO L87 Difference]: Start difference. First operand 641 states and 898 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:03:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:22,222 INFO L93 Difference]: Finished difference Result 1265 states and 1780 transitions. [2025-02-06 18:03:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:22,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 18:03:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:22,226 INFO L225 Difference]: With dead ends: 1265 [2025-02-06 18:03:22,226 INFO L226 Difference]: Without dead ends: 644 [2025-02-06 18:03:22,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:22,228 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 2 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1719 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-02-06 18:03:22,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1719 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:03:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-06 18:03:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2025-02-06 18:03:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 522 states have (on average 1.553639846743295) internal successors, (811), 594 states have internal predecessors, (811), 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-02-06 18:03:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 901 transitions. [2025-02-06 18:03:22,249 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 901 transitions. Word has length 27 [2025-02-06 18:03:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:22,249 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 901 transitions. [2025-02-06 18:03:22,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:03:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 901 transitions. [2025-02-06 18:03:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 18:03:22,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:22,250 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-02-06 18:03:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:03:22,251 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-02-06 18:03:22,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2000805862, now seen corresponding path program 1 times [2025-02-06 18:03:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:22,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736037256] [2025-02-06 18:03:22,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:22,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 18:03:22,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 18:03:22,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:22,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:03:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736037256] [2025-02-06 18:03:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736037256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:23,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:23,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:03:23,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039738883] [2025-02-06 18:03:23,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:23,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:23,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:23,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:23,121 INFO L87 Difference]: Start difference. First operand 644 states and 901 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-02-06 18:03:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:23,527 INFO L93 Difference]: Finished difference Result 943 states and 1341 transitions. [2025-02-06 18:03:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:23,527 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-02-06 18:03:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:23,531 INFO L225 Difference]: With dead ends: 943 [2025-02-06 18:03:23,531 INFO L226 Difference]: Without dead ends: 941 [2025-02-06 18:03:23,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:23,531 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 412 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1706 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-02-06 18:03:23,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1706 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:03:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-02-06 18:03:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 648. [2025-02-06 18:03:23,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 526 states have (on average 1.5513307984790874) internal successors, (816), 598 states have internal predecessors, (816), 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-02-06 18:03:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 906 transitions. [2025-02-06 18:03:23,552 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 906 transitions. Word has length 28 [2025-02-06 18:03:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:23,553 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 906 transitions. [2025-02-06 18:03:23,553 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-02-06 18:03:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 906 transitions. [2025-02-06 18:03:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:03:23,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:23,553 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:03:23,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:03:23,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-06 18:03:23,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1044507387, now seen corresponding path program 1 times [2025-02-06 18:03:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:23,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619560723] [2025-02-06 18:03:23,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:24,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:03:24,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:03:24,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:24,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-06 18:03:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619560723] [2025-02-06 18:03:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619560723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:03:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766626994] [2025-02-06 18:03:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:24,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:24,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:24,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:24,379 INFO L87 Difference]: Start difference. First operand 648 states and 906 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:03:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:24,727 INFO L93 Difference]: Finished difference Result 661 states and 921 transitions. [2025-02-06 18:03:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:24,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-02-06 18:03:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:24,730 INFO L225 Difference]: With dead ends: 661 [2025-02-06 18:03:24,730 INFO L226 Difference]: Without dead ends: 659 [2025-02-06 18:03:24,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:24,731 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 3 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1716 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-02-06 18:03:24,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1716 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:03:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-06 18:03:24,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2025-02-06 18:03:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 535 states have (on average 1.5495327102803738) internal successors, (829), 607 states have internal predecessors, (829), 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-02-06 18:03:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 919 transitions. [2025-02-06 18:03:24,744 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 919 transitions. Word has length 30 [2025-02-06 18:03:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:24,744 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 919 transitions. [2025-02-06 18:03:24,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:03:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 919 transitions. [2025-02-06 18:03:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:03:24,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:24,745 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-02-06 18:03:24,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:03:24,745 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-06 18:03:24,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1044507227, now seen corresponding path program 1 times [2025-02-06 18:03:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102870019] [2025-02-06 18:03:24,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:25,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:03:25,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:03:25,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:25,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:03:25,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:25,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102870019] [2025-02-06 18:03:25,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102870019] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:03:25,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916423589] [2025-02-06 18:03:25,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:25,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:25,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:03:25,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:03:25,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:03:26,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:03:26,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:03:26,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:26,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:26,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:03:26,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:03:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:03:27,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:03:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:03:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916423589] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:03:27,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:03:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:03:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651007939] [2025-02-06 18:03:27,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:03:27,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:03:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:27,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:03:27,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:03:27,805 INFO L87 Difference]: Start difference. First operand 657 states and 919 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-02-06 18:03:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:28,714 INFO L93 Difference]: Finished difference Result 1316 states and 1846 transitions. [2025-02-06 18:03:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:03:28,715 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-02-06 18:03:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:28,717 INFO L225 Difference]: With dead ends: 1316 [2025-02-06 18:03:28,718 INFO L226 Difference]: Without dead ends: 674 [2025-02-06 18:03:28,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:03:28,719 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 5 mSDsluCounter, 3416 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 18:03:28,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4272 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 18:03:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-02-06 18:03:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2025-02-06 18:03:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 553 states have (on average 1.5280289330922243) internal successors, (845), 624 states have internal predecessors, (845), 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-02-06 18:03:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 935 transitions. [2025-02-06 18:03:28,734 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 935 transitions. Word has length 30 [2025-02-06 18:03:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 935 transitions. [2025-02-06 18:03:28,734 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-02-06 18:03:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 935 transitions. [2025-02-06 18:03:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:03:28,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:28,735 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-02-06 18:03:28,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 18:03:28,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 18:03:28,941 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-02-06 18:03:28,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1468247554, now seen corresponding path program 1 times [2025-02-06 18:03:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:28,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229167294] [2025-02-06 18:03:28,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:29,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:03:29,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:03:29,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:29,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:03:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229167294] [2025-02-06 18:03:29,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229167294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:29,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:29,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:03:29,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587590921] [2025-02-06 18:03:29,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:29,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:29,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:29,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:29,714 INFO L87 Difference]: Start difference. First operand 674 states and 935 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-02-06 18:03:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:29,962 INFO L93 Difference]: Finished difference Result 674 states and 935 transitions. [2025-02-06 18:03:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:29,963 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-02-06 18:03:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:29,965 INFO L225 Difference]: With dead ends: 674 [2025-02-06 18:03:29,965 INFO L226 Difference]: Without dead ends: 673 [2025-02-06 18:03:29,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:29,966 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 0 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1717 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-02-06 18:03:29,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:03:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-02-06 18:03:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 669. [2025-02-06 18:03:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 549 states have (on average 1.5282331511839709) internal successors, (839), 619 states have internal predecessors, (839), 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-02-06 18:03:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 929 transitions. [2025-02-06 18:03:29,978 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 929 transitions. Word has length 49 [2025-02-06 18:03:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 929 transitions. [2025-02-06 18:03:29,978 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-02-06 18:03:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 929 transitions. [2025-02-06 18:03:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 18:03:29,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:29,979 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-02-06 18:03:29,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:03:29,979 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-02-06 18:03:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1617602186, now seen corresponding path program 1 times [2025-02-06 18:03:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:29,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452636163] [2025-02-06 18:03:29,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:30,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:03:30,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:03:30,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:03:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452636163] [2025-02-06 18:03:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452636163] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:03:30,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686760979] [2025-02-06 18:03:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:30,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:30,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:03:30,801 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:03:30,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:03:31,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:03:32,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:03:32,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:32,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 2233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:03:32,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:03:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:03:32,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:03:32,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686760979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:32,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:03:32,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:03:32,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060356998] [2025-02-06 18:03:32,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:32,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:03:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:32,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:03:32,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:03:32,256 INFO L87 Difference]: Start difference. First operand 669 states and 929 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-02-06 18:03:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:32,815 INFO L93 Difference]: Finished difference Result 966 states and 1368 transitions. [2025-02-06 18:03:32,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:03:32,816 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-02-06 18:03:32,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:32,819 INFO L225 Difference]: With dead ends: 966 [2025-02-06 18:03:32,819 INFO L226 Difference]: Without dead ends: 965 [2025-02-06 18:03:32,819 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-02-06 18:03:32,820 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 823 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:03:32,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 2117 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 18:03:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2025-02-06 18:03:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 668. [2025-02-06 18:03:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 549 states have (on average 1.5264116575591986) internal successors, (838), 618 states have internal predecessors, (838), 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-02-06 18:03:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 928 transitions. [2025-02-06 18:03:32,833 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 928 transitions. Word has length 50 [2025-02-06 18:03:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:32,833 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 928 transitions. [2025-02-06 18:03:32,834 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-02-06 18:03:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 928 transitions. [2025-02-06 18:03:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 18:03:32,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:32,834 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-02-06 18:03:32,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:03:33,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 18:03:33,035 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-02-06 18:03:33,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1393938677, now seen corresponding path program 1 times [2025-02-06 18:03:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919036198] [2025-02-06 18:03:33,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:33,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:03:33,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:03:33,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:33,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:03:33,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919036198] [2025-02-06 18:03:33,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919036198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:03:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412432579] [2025-02-06 18:03:33,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:33,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:33,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:03:33,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:03:33,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:03:35,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:03:35,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:03:35,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:35,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:35,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 2234 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:03:35,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:03:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:03:35,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:03:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:03:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412432579] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:03:35,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:03:35,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 18:03:35,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514334967] [2025-02-06 18:03:35,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:03:35,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:03:35,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:35,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:03:35,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:03:35,587 INFO L87 Difference]: Start difference. First operand 668 states and 928 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-02-06 18:03:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:36,617 INFO L93 Difference]: Finished difference Result 1853 states and 2678 transitions. [2025-02-06 18:03:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:03:36,618 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-02-06 18:03:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:36,622 INFO L225 Difference]: With dead ends: 1853 [2025-02-06 18:03:36,623 INFO L226 Difference]: Without dead ends: 1852 [2025-02-06 18:03:36,623 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-02-06 18:03:36,623 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 2934 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2966 SdHoareTripleChecker+Valid, 3242 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:03:36,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2966 Valid, 3242 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 18:03:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-02-06 18:03:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 680. [2025-02-06 18:03:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 561 states have (on average 1.5204991087344029) internal successors, (853), 630 states have internal predecessors, (853), 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-02-06 18:03:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 943 transitions. [2025-02-06 18:03:36,642 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 943 transitions. Word has length 51 [2025-02-06 18:03:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:36,642 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 943 transitions. [2025-02-06 18:03:36,642 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-02-06 18:03:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 943 transitions. [2025-02-06 18:03:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 18:03:36,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:36,643 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-02-06 18:03:36,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 18:03:36,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 18:03:36,844 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-02-06 18:03:36,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2140961100, now seen corresponding path program 1 times [2025-02-06 18:03:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:36,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842943205] [2025-02-06 18:03:36,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:37,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:03:37,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:03:37,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:37,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:03:37,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:37,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842943205] [2025-02-06 18:03:37,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842943205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:03:37,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664453516] [2025-02-06 18:03:37,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:37,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:03:37,721 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:03:37,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:03:38,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:03:39,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:03:39,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:39,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:39,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 2197 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:03:39,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:03:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:03:39,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:03:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-06 18:03:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664453516] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:03:39,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:03:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:03:39,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422789234] [2025-02-06 18:03:39,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:03:39,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:03:39,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:39,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:03:39,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:03:39,328 INFO L87 Difference]: Start difference. First operand 680 states and 943 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-02-06 18:03:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:39,599 INFO L93 Difference]: Finished difference Result 1335 states and 1863 transitions. [2025-02-06 18:03:39,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:03:39,602 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-02-06 18:03:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:39,604 INFO L225 Difference]: With dead ends: 1335 [2025-02-06 18:03:39,604 INFO L226 Difference]: Without dead ends: 698 [2025-02-06 18:03:39,605 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-02-06 18:03:39,605 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 4 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:03:39,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1715 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:03:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-02-06 18:03:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-02-06 18:03:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 579 states have (on average 1.5043177892918826) internal successors, (871), 648 states have internal predecessors, (871), 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-02-06 18:03:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 961 transitions. [2025-02-06 18:03:39,619 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 961 transitions. Word has length 55 [2025-02-06 18:03:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:39,619 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 961 transitions. [2025-02-06 18:03:39,619 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-02-06 18:03:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 961 transitions. [2025-02-06 18:03:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 18:03:39,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:39,621 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-02-06 18:03:39,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 18:03:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:39,822 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-02-06 18:03:39,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1785485515, now seen corresponding path program 1 times [2025-02-06 18:03:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806063133] [2025-02-06 18:03:39,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:40,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 18:03:40,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 18:03:40,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:40,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:03:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806063133] [2025-02-06 18:03:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806063133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:40,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:03:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611595462] [2025-02-06 18:03:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:40,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:40,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:40,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:40,644 INFO L87 Difference]: Start difference. First operand 698 states and 961 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-02-06 18:03:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:41,087 INFO L93 Difference]: Finished difference Result 1392 states and 1949 transitions. [2025-02-06 18:03:41,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:41,088 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-02-06 18:03:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:41,091 INFO L225 Difference]: With dead ends: 1392 [2025-02-06 18:03:41,091 INFO L226 Difference]: Without dead ends: 794 [2025-02-06 18:03:41,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:41,096 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 119 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1687 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-02-06 18:03:41,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1687 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:03:41,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-02-06 18:03:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 740. [2025-02-06 18:03:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 620 states have (on average 1.4951612903225806) internal successors, (927), 689 states have internal predecessors, (927), 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-02-06 18:03:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1019 transitions. [2025-02-06 18:03:41,129 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1019 transitions. Word has length 60 [2025-02-06 18:03:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1019 transitions. [2025-02-06 18:03:41,131 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-02-06 18:03:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1019 transitions. [2025-02-06 18:03:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 18:03:41,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:41,131 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-02-06 18:03:41,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:03:41,132 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-02-06 18:03:41,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2135303767, now seen corresponding path program 1 times [2025-02-06 18:03:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104934940] [2025-02-06 18:03:41,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:03:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:41,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 18:03:41,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 18:03:41,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:03:41,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 18:03:41,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104934940] [2025-02-06 18:03:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104934940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:03:41,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143852377] [2025-02-06 18:03:41,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:41,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:03:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:41,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:03:41,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:41,966 INFO L87 Difference]: Start difference. First operand 740 states and 1019 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-02-06 18:03:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:42,231 INFO L93 Difference]: Finished difference Result 742 states and 1019 transitions. [2025-02-06 18:03:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:03:42,232 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-02-06 18:03:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:42,234 INFO L225 Difference]: With dead ends: 742 [2025-02-06 18:03:42,235 INFO L226 Difference]: Without dead ends: 740 [2025-02-06 18:03:42,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:03:42,235 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 1 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1715 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-02-06 18:03:42,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1715 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:03:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-02-06 18:03:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2025-02-06 18:03:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 620 states have (on average 1.4919354838709677) internal successors, (925), 689 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-02-06 18:03:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1017 transitions. [2025-02-06 18:03:42,252 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1017 transitions. Word has length 62 [2025-02-06 18:03:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:42,252 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1017 transitions. [2025-02-06 18:03:42,253 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-02-06 18:03:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1017 transitions. [2025-02-06 18:03:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 18:03:42,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:42,253 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-02-06 18:03:42,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:03:42,254 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-02-06 18:03:42,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1369039039, now seen corresponding path program 2 times [2025-02-06 18:03:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:42,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895983673] [2025-02-06 18:03:42,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:03:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:42,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-06 18:03:43,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-02-06 18:03:43,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:03:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-06 18:03:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895983673] [2025-02-06 18:03:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895983673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:03:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:03:43,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:03:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790637544] [2025-02-06 18:03:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:03:43,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:03:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:03:43,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:03:43,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:03:43,639 INFO L87 Difference]: Start difference. First operand 740 states and 1017 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-02-06 18:03:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:03:44,913 INFO L93 Difference]: Finished difference Result 1408 states and 1956 transitions. [2025-02-06 18:03:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:03:44,915 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-02-06 18:03:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:03:44,918 INFO L225 Difference]: With dead ends: 1408 [2025-02-06 18:03:44,918 INFO L226 Difference]: Without dead ends: 740 [2025-02-06 18:03:44,919 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-02-06 18:03:44,920 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 729 mSDsluCounter, 2535 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 3364 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-02-06 18:03:44,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 3364 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 18:03:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-02-06 18:03:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2025-02-06 18:03:44,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 620 states have (on average 1.4903225806451612) internal successors, (924), 689 states have internal predecessors, (924), 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-02-06 18:03:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1016 transitions. [2025-02-06 18:03:44,936 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1016 transitions. Word has length 63 [2025-02-06 18:03:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:03:44,936 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1016 transitions. [2025-02-06 18:03:44,936 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-02-06 18:03:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1016 transitions. [2025-02-06 18:03:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 18:03:44,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:03:44,936 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-02-06 18:03:44,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:03:44,937 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-02-06 18:03:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:03:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 776577124, now seen corresponding path program 2 times [2025-02-06 18:03:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:03:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530645429] [2025-02-06 18:03:44,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:03:44,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:03:45,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 18:03:45,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 18:03:45,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:03:45,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:03:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-06 18:03:46,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:03:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530645429] [2025-02-06 18:03:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530645429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:03:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328531470] [2025-02-06 18:03:46,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:03:46,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:03:46,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:03:46,028 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:03:46,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:03:47,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes.