./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/who-2.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/who-2.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 e0b6053e1bcaf28528cb48e3712d575ac5a666d224e39ce4315a9d6b0f4fb21c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:04:20,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:04:21,014 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:04:21,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:04:21,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:04:21,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:04:21,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:04:21,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:04:21,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:04:21,036 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:04:21,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:04:21,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:04:21,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:04:21,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:04:21,037 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:04:21,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:04:21,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:04:21,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:04:21,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:04:21,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:04:21,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:04:21,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:04:21,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:04:21,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:04:21,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:04:21,039 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 -> e0b6053e1bcaf28528cb48e3712d575ac5a666d224e39ce4315a9d6b0f4fb21c [2025-02-06 18:04:21,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:04:21,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:04:21,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:04:21,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:04:21,251 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:04:21,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/who-2.i [2025-02-06 18:04:22,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b38796fb0/9dcd612dbdfc453593675f14625a1e68/FLAGd805914f3 [2025-02-06 18:04:22,909 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:04:22,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/who-2.i [2025-02-06 18:04:22,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b38796fb0/9dcd612dbdfc453593675f14625a1e68/FLAGd805914f3 [2025-02-06 18:04:23,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b38796fb0/9dcd612dbdfc453593675f14625a1e68 [2025-02-06 18:04:23,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:04:23,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:04:23,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:04:23,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:04:23,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:04:23,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:04:23" (1/1) ... [2025-02-06 18:04:23,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1b79b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:23, skipping insertion in model container [2025-02-06 18:04:23,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:04:23" (1/1) ... [2025-02-06 18:04:23,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:04:23,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:04:23,835 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:04:23,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:04:24,101 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-06 18:04:24,107 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:04:24,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24 WrapperNode [2025-02-06 18:04:24,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:04:24,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:04:24,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:04:24,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:04:24,113 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:04:24" (1/1) ... [2025-02-06 18:04:24,140 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:04:24" (1/1) ... [2025-02-06 18:04:24,190 INFO L138 Inliner]: procedures = 639, calls = 723, calls flagged for inlining = 29, calls inlined = 28, statements flattened = 1971 [2025-02-06 18:04:24,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:04:24,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:04:24,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:04:24,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:04:24,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,239 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 18:04:24,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:04:24,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:04:24,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:04:24,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:04:24,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (1/1) ... [2025-02-06 18:04:24,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:04:24,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:24,336 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:04:24,346 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:04:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:04:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-06 18:04:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 18:04:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 18:04:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:04:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:04:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 18:04:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:04:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:04:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-06 18:04:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-06 18:04:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-06 18:04:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-06 18:04:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-06 18:04:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-06 18:04:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-06 18:04:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-06 18:04:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 18:04:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 18:04:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:04:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 18:04:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 18:04:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 18:04:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-06 18:04:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-06 18:04:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 18:04:24,636 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:04:24,637 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:04:26,601 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273: havoc getopt_long_#t~ret263#1; [2025-02-06 18:04:26,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2591: 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:04:26,743 INFO L? ?]: Removed 611 outVars from TransFormulas that were not future-live. [2025-02-06 18:04:26,743 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:04:26,771 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:04:26,772 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:04:26,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:04:26 BoogieIcfgContainer [2025-02-06 18:04:26,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:04:26,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:04:26,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:04:26,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:04:26,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:04:23" (1/3) ... [2025-02-06 18:04:26,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27773d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:04:26, skipping insertion in model container [2025-02-06 18:04:26,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:04:24" (2/3) ... [2025-02-06 18:04:26,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27773d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:04:26, skipping insertion in model container [2025-02-06 18:04:26,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:04:26" (3/3) ... [2025-02-06 18:04:26,779 INFO L128 eAbstractionObserver]: Analyzing ICFG who-2.i [2025-02-06 18:04:26,789 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:04:26,792 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG who-2.i that has 6 procedures, 514 locations, 1 initial locations, 33 loop locations, and 70 error locations. [2025-02-06 18:04:26,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:04:26,840 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;@7c404304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:04:26,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-02-06 18:04:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 514 states, 418 states have (on average 1.6698564593301435) internal successors, (698), 489 states have internal predecessors, (698), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:04:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 18:04:26,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:26,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 18:04:26,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:26,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:26,850 INFO L85 PathProgramCache]: Analyzing trace with hash 27150463, now seen corresponding path program 1 times [2025-02-06 18:04:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:26,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629114355] [2025-02-06 18:04:26,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:26,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:27,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 18:04:27,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 18:04:27,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:27,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:27,374 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:04:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629114355] [2025-02-06 18:04:27,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629114355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:27,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:27,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122226092] [2025-02-06 18:04:27,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:27,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:27,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:27,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:27,392 INFO L87 Difference]: Start difference. First operand has 514 states, 418 states have (on average 1.6698564593301435) internal successors, (698), 489 states have internal predecessors, (698), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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:04:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:27,482 INFO L93 Difference]: Finished difference Result 939 states and 1376 transitions. [2025-02-06 18:04:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:27,483 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:04:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:27,489 INFO L225 Difference]: With dead ends: 939 [2025-02-06 18:04:27,489 INFO L226 Difference]: Without dead ends: 426 [2025-02-06 18:04:27,493 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:04:27,495 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:27,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-06 18:04:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-02-06 18:04:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 357 states have (on average 1.588235294117647) internal successors, (567), 408 states have internal predecessors, (567), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 595 transitions. [2025-02-06 18:04:27,532 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 595 transitions. Word has length 4 [2025-02-06 18:04:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:27,532 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 595 transitions. [2025-02-06 18:04:27,532 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:04:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 595 transitions. [2025-02-06 18:04:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:04:27,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:27,533 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 18:04:27,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:04:27,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:27,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1386401999, now seen corresponding path program 1 times [2025-02-06 18:04:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:27,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052430484] [2025-02-06 18:04:27,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:27,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:27,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:04:27,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:04:27,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:27,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:27,856 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:04:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:27,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052430484] [2025-02-06 18:04:27,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052430484] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:27,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799372856] [2025-02-06 18:04:27,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:27,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:27,859 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:04:27,869 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:04:28,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:04:28,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:04:28,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:28,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:28,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:28,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:28,288 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:04:28,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799372856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:28,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:28,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:04:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527695807] [2025-02-06 18:04:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:28,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:28,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:28,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:28,291 INFO L87 Difference]: Start difference. First operand 426 states and 595 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:04:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:28,351 INFO L93 Difference]: Finished difference Result 426 states and 595 transitions. [2025-02-06 18:04:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:04:28,352 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:04:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:28,354 INFO L225 Difference]: With dead ends: 426 [2025-02-06 18:04:28,354 INFO L226 Difference]: Without dead ends: 425 [2025-02-06 18:04:28,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:28,355 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:28,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1129 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-02-06 18:04:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-02-06 18:04:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 357 states have (on average 1.5854341736694677) internal successors, (566), 407 states have internal predecessors, (566), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 594 transitions. [2025-02-06 18:04:28,369 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 594 transitions. Word has length 7 [2025-02-06 18:04:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:28,369 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 594 transitions. [2025-02-06 18:04:28,369 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:04:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 594 transitions. [2025-02-06 18:04:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:04:28,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:28,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-02-06 18:04:28,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 18:04:28,570 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:04:28,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:28,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash 28789825, now seen corresponding path program 1 times [2025-02-06 18:04:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586427822] [2025-02-06 18:04:28,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:28,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:04:28,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:04:28,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:28,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:28,800 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:04:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586427822] [2025-02-06 18:04:28,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586427822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:28,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:28,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416440816] [2025-02-06 18:04:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:28,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:28,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:28,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:28,803 INFO L87 Difference]: Start difference. First operand 425 states and 594 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:04:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:28,863 INFO L93 Difference]: Finished difference Result 425 states and 594 transitions. [2025-02-06 18:04:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:28,864 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:04:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:28,866 INFO L225 Difference]: With dead ends: 425 [2025-02-06 18:04:28,867 INFO L226 Difference]: Without dead ends: 424 [2025-02-06 18:04:28,868 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:04:28,868 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 0 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:28,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1130 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-06 18:04:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2025-02-06 18:04:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 355 states have (on average 1.5859154929577466) internal successors, (563), 404 states have internal predecessors, (563), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 591 transitions. [2025-02-06 18:04:28,898 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 591 transitions. Word has length 8 [2025-02-06 18:04:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:28,898 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 591 transitions. [2025-02-06 18:04:28,898 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:04:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 591 transitions. [2025-02-06 18:04:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 18:04:28,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:28,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:28,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:04:28,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1674637004, now seen corresponding path program 1 times [2025-02-06 18:04:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:28,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466616138] [2025-02-06 18:04:28,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:28,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:29,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:04:29,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:04:29,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:29,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:29,194 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:04:29,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:29,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466616138] [2025-02-06 18:04:29,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466616138] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:29,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614168851] [2025-02-06 18:04:29,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:29,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:29,199 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:04:29,207 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:04:29,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:04:29,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:04:29,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:29,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:29,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 18:04:29,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:29,625 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:04:29,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614168851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:29,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 18:04:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615731004] [2025-02-06 18:04:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:29,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:29,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:29,627 INFO L87 Difference]: Start difference. First operand 422 states and 591 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:04:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:29,686 INFO L93 Difference]: Finished difference Result 422 states and 591 transitions. [2025-02-06 18:04:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:29,687 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:04:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:29,689 INFO L225 Difference]: With dead ends: 422 [2025-02-06 18:04:29,690 INFO L226 Difference]: Without dead ends: 420 [2025-02-06 18:04:29,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:29,691 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 526 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:29,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 604 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-06 18:04:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-02-06 18:04:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 355 states have (on average 1.580281690140845) internal successors, (561), 402 states have internal predecessors, (561), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 589 transitions. [2025-02-06 18:04:29,714 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 589 transitions. Word has length 12 [2025-02-06 18:04:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:29,715 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 589 transitions. [2025-02-06 18:04:29,715 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:04:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 589 transitions. [2025-02-06 18:04:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 18:04:29,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:29,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:29,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:04:29,920 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:04:29,920 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:29,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash -374138762, now seen corresponding path program 1 times [2025-02-06 18:04:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317080860] [2025-02-06 18:04:29,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:30,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:04:30,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:04:30,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:30,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:30,139 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:04:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317080860] [2025-02-06 18:04:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317080860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268331714] [2025-02-06 18:04:30,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:30,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:30,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:30,144 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:04:30,144 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:04:30,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:04:30,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:04:30,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:30,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:30,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:30,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:30,546 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:04:30,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:30,571 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:04:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268331714] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:30,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:30,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:04:30,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425505799] [2025-02-06 18:04:30,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:30,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:30,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:30,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:30,573 INFO L87 Difference]: Start difference. First operand 420 states and 589 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:04:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:30,642 INFO L93 Difference]: Finished difference Result 843 states and 1183 transitions. [2025-02-06 18:04:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:30,644 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:04:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:30,646 INFO L225 Difference]: With dead ends: 843 [2025-02-06 18:04:30,646 INFO L226 Difference]: Without dead ends: 429 [2025-02-06 18:04:30,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:30,647 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 4 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1126 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:30,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1126 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-06 18:04:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-02-06 18:04:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 364 states have (on average 1.565934065934066) internal successors, (570), 411 states have internal predecessors, (570), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 598 transitions. [2025-02-06 18:04:30,657 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 598 transitions. Word has length 13 [2025-02-06 18:04:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:30,657 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 598 transitions. [2025-02-06 18:04:30,657 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:04:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 598 transitions. [2025-02-06 18:04:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 18:04:30,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:30,658 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:30,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:04:30,859 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:04:30,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:30,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash -376092634, now seen corresponding path program 2 times [2025-02-06 18:04:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:30,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103412939] [2025-02-06 18:04:30,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:30,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-06 18:04:30,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-02-06 18:04:30,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:04:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:31,208 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:04:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103412939] [2025-02-06 18:04:31,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103412939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:31,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:31,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:04:31,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654847363] [2025-02-06 18:04:31,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:31,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:04:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:31,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:04:31,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:31,210 INFO L87 Difference]: Start difference. First operand 429 states and 598 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:04:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:31,306 INFO L93 Difference]: Finished difference Result 429 states and 598 transitions. [2025-02-06 18:04:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:04:31,307 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:04:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:31,309 INFO L225 Difference]: With dead ends: 429 [2025-02-06 18:04:31,309 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 18:04:31,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:31,309 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 525 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:31,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1693 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 18:04:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-02-06 18:04:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 364 states have (on average 1.5604395604395604) internal successors, (568), 409 states have internal predecessors, (568), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 596 transitions. [2025-02-06 18:04:31,321 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 596 transitions. Word has length 22 [2025-02-06 18:04:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:31,321 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 596 transitions. [2025-02-06 18:04:31,321 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:04:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 596 transitions. [2025-02-06 18:04:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 18:04:31,321 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:31,322 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:04:31,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:04:31,322 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:31,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash 390374463, now seen corresponding path program 1 times [2025-02-06 18:04:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348736679] [2025-02-06 18:04:31,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:31,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 18:04:31,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 18:04:31,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:31,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:31,579 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:04:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348736679] [2025-02-06 18:04:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348736679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:31,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:31,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397117096] [2025-02-06 18:04:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:31,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:31,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:31,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:31,581 INFO L87 Difference]: Start difference. First operand 427 states and 596 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:04:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:31,643 INFO L93 Difference]: Finished difference Result 837 states and 1176 transitions. [2025-02-06 18:04:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:31,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-06 18:04:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:31,645 INFO L225 Difference]: With dead ends: 837 [2025-02-06 18:04:31,645 INFO L226 Difference]: Without dead ends: 430 [2025-02-06 18:04:31,646 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:04:31,646 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:31,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1119 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-06 18:04:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-02-06 18:04:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 367 states have (on average 1.555858310626703) internal successors, (571), 412 states have internal predecessors, (571), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 599 transitions. [2025-02-06 18:04:31,660 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 599 transitions. Word has length 27 [2025-02-06 18:04:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:31,660 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 599 transitions. [2025-02-06 18:04:31,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:04:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 599 transitions. [2025-02-06 18:04:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 18:04:31,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:31,661 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:04:31,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:04:31,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:31,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash -783632352, now seen corresponding path program 1 times [2025-02-06 18:04:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048410792] [2025-02-06 18:04:31,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:31,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 18:04:31,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 18:04:31,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:31,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:31,899 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:04:31,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:31,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048410792] [2025-02-06 18:04:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048410792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:31,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:31,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971619229] [2025-02-06 18:04:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:31,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:31,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:31,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:31,901 INFO L87 Difference]: Start difference. First operand 430 states and 599 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:04:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:31,982 INFO L93 Difference]: Finished difference Result 729 states and 1038 transitions. [2025-02-06 18:04:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:31,982 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:04:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:31,985 INFO L225 Difference]: With dead ends: 729 [2025-02-06 18:04:31,985 INFO L226 Difference]: Without dead ends: 727 [2025-02-06 18:04:31,985 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:04:31,986 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 413 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:31,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1106 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-06 18:04:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 434. [2025-02-06 18:04:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 371 states have (on average 1.5525606469002695) internal successors, (576), 416 states have internal predecessors, (576), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 604 transitions. [2025-02-06 18:04:32,002 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 604 transitions. Word has length 28 [2025-02-06 18:04:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:32,002 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 604 transitions. [2025-02-06 18:04:32,002 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:04:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 604 transitions. [2025-02-06 18:04:32,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 18:04:32,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:32,003 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:04:32,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:04:32,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:32,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:32,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1125015809, now seen corresponding path program 1 times [2025-02-06 18:04:32,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:32,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442328377] [2025-02-06 18:04:32,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:32,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:04:32,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:04:32,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:32,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:32,279 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:04:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442328377] [2025-02-06 18:04:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442328377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733063041] [2025-02-06 18:04:32,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:32,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:32,282 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:04:32,286 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:04:32,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:04:32,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:04:32,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:32,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:32,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:04:32,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:32,735 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:04:32,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:32,801 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:04:32,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733063041] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:32,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:32,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:04:32,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870765922] [2025-02-06 18:04:32,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:32,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:04:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:32,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:04:32,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:04:32,803 INFO L87 Difference]: Start difference. First operand 434 states and 604 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:04:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:32,992 INFO L93 Difference]: Finished difference Result 870 states and 1216 transitions. [2025-02-06 18:04:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:04:32,993 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:04:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:32,995 INFO L225 Difference]: With dead ends: 870 [2025-02-06 18:04:32,995 INFO L226 Difference]: Without dead ends: 451 [2025-02-06 18:04:32,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:04:32,996 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 5 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:32,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3880 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-06 18:04:33,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2025-02-06 18:04:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 389 states have (on average 1.5244215938303343) internal successors, (593), 433 states have internal predecessors, (593), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 621 transitions. [2025-02-06 18:04:33,008 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 621 transitions. Word has length 30 [2025-02-06 18:04:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:33,009 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 621 transitions. [2025-02-06 18:04:33,009 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:04:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 621 transitions. [2025-02-06 18:04:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 18:04:33,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:33,010 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:33,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:04:33,210 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,SelfDestructingSolverStorable8 [2025-02-06 18:04:33,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:33,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2102376543, now seen corresponding path program 1 times [2025-02-06 18:04:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:33,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566703288] [2025-02-06 18:04:33,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:33,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 18:04:33,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 18:04:33,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:33,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-06 18:04:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566703288] [2025-02-06 18:04:33,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566703288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:33,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:33,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715864802] [2025-02-06 18:04:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:33,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:33,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:33,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:33,459 INFO L87 Difference]: Start difference. First operand 451 states and 621 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:04:33,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:33,518 INFO L93 Difference]: Finished difference Result 463 states and 635 transitions. [2025-02-06 18:04:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:33,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 18:04:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:33,520 INFO L225 Difference]: With dead ends: 463 [2025-02-06 18:04:33,520 INFO L226 Difference]: Without dead ends: 461 [2025-02-06 18:04:33,521 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:04:33,521 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 2 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:33,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1114 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-02-06 18:04:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2025-02-06 18:04:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 398 states have (on average 1.520100502512563) internal successors, (605), 442 states have internal predecessors, (605), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 633 transitions. [2025-02-06 18:04:33,538 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 633 transitions. Word has length 48 [2025-02-06 18:04:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:33,538 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 633 transitions. [2025-02-06 18:04:33,538 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:04:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 633 transitions. [2025-02-06 18:04:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 18:04:33,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:33,540 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:04:33,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:04:33,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:33,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 749169153, now seen corresponding path program 1 times [2025-02-06 18:04:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:33,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978641200] [2025-02-06 18:04:33,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:33,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:04:33,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:04:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:33,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:33,787 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:04:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978641200] [2025-02-06 18:04:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978641200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:33,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:33,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:33,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832275917] [2025-02-06 18:04:33,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:33,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:33,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:33,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:33,788 INFO L87 Difference]: Start difference. First operand 460 states and 633 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:04:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:33,834 INFO L93 Difference]: Finished difference Result 460 states and 633 transitions. [2025-02-06 18:04:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:33,834 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:04:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:33,836 INFO L225 Difference]: With dead ends: 460 [2025-02-06 18:04:33,836 INFO L226 Difference]: Without dead ends: 459 [2025-02-06 18:04:33,836 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:04:33,836 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 0 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:33,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1117 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-06 18:04:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2025-02-06 18:04:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 394 states have (on average 1.5203045685279188) internal successors, (599), 437 states have internal predecessors, (599), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 627 transitions. [2025-02-06 18:04:33,848 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 627 transitions. Word has length 49 [2025-02-06 18:04:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:33,848 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 627 transitions. [2025-02-06 18:04:33,848 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:04:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 627 transitions. [2025-02-06 18:04:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 18:04:33,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:33,849 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:04:33,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:04:33,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:33,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1638043044, now seen corresponding path program 1 times [2025-02-06 18:04:33,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:33,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958190780] [2025-02-06 18:04:33,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:33,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:33,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:04:33,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:04:33,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:33,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:34,066 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:04:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:34,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958190780] [2025-02-06 18:04:34,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958190780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:34,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061525276] [2025-02-06 18:04:34,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:34,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:34,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:34,071 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:04:34,076 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:04:34,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 18:04:34,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 18:04:34,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:34,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:34,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:34,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:34,936 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:04:34,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:34,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061525276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:34,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:34,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 18:04:34,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163509900] [2025-02-06 18:04:34,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:34,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:34,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:34,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:34,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:34,937 INFO L87 Difference]: Start difference. First operand 455 states and 627 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:04:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:35,129 INFO L93 Difference]: Finished difference Result 752 states and 1064 transitions. [2025-02-06 18:04:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:04:35,129 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:04:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:35,132 INFO L225 Difference]: With dead ends: 752 [2025-02-06 18:04:35,132 INFO L226 Difference]: Without dead ends: 751 [2025-02-06 18:04:35,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:04:35,135 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 825 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:35,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1675 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-02-06 18:04:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 454. [2025-02-06 18:04:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 394 states have (on average 1.517766497461929) internal successors, (598), 436 states have internal predecessors, (598), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 626 transitions. [2025-02-06 18:04:35,151 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 626 transitions. Word has length 50 [2025-02-06 18:04:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:35,152 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 626 transitions. [2025-02-06 18:04:35,152 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:04:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 626 transitions. [2025-02-06 18:04:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 18:04:35,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:35,154 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:04:35,164 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:04:35,358 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:04:35,358 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:35,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash -760272402, now seen corresponding path program 1 times [2025-02-06 18:04:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:35,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012976048] [2025-02-06 18:04:35,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:35,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:35,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:04:35,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:04:35,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:35,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:35,569 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:04:35,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012976048] [2025-02-06 18:04:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012976048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593987663] [2025-02-06 18:04:35,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:35,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:35,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:35,571 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:04:35,573 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:04:35,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:04:36,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:04:36,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:36,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:36,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:36,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:36,078 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:04:36,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:36,100 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:04:36,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593987663] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:36,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:36,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 18:04:36,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174173853] [2025-02-06 18:04:36,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:36,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:36,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:36,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:36,102 INFO L87 Difference]: Start difference. First operand 454 states and 626 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:04:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:36,317 INFO L93 Difference]: Finished difference Result 1639 states and 2372 transitions. [2025-02-06 18:04:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:36,318 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:04:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:36,323 INFO L225 Difference]: With dead ends: 1639 [2025-02-06 18:04:36,323 INFO L226 Difference]: Without dead ends: 1638 [2025-02-06 18:04:36,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:36,324 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2924 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2952 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:36,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2952 Valid, 2451 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-02-06 18:04:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 466. [2025-02-06 18:04:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 406 states have (on average 1.5098522167487685) internal successors, (613), 448 states have internal predecessors, (613), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 641 transitions. [2025-02-06 18:04:36,341 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 641 transitions. Word has length 51 [2025-02-06 18:04:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:36,341 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 641 transitions. [2025-02-06 18:04:36,341 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:04:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 641 transitions. [2025-02-06 18:04:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 18:04:36,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:36,342 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:04:36,351 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:04:36,542 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:04:36,543 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:36,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash -217931945, now seen corresponding path program 1 times [2025-02-06 18:04:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551670853] [2025-02-06 18:04:36,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:36,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:04:36,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:04:36,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:36,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:36,740 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:04:36,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:36,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551670853] [2025-02-06 18:04:36,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551670853] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:36,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551113900] [2025-02-06 18:04:36,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:36,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:36,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:36,742 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:04:36,744 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:04:37,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:04:37,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:04:37,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:37,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:37,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:37,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:37,270 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:04:37,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:37,295 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:04:37,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551113900] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:37,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 18:04:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190553831] [2025-02-06 18:04:37,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:37,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:37,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:37,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:37,296 INFO L87 Difference]: Start difference. First operand 466 states and 641 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:04:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:37,374 INFO L93 Difference]: Finished difference Result 907 states and 1259 transitions. [2025-02-06 18:04:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:37,375 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:04:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:37,376 INFO L225 Difference]: With dead ends: 907 [2025-02-06 18:04:37,377 INFO L226 Difference]: Without dead ends: 484 [2025-02-06 18:04:37,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:37,378 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 4 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:37,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2227 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-02-06 18:04:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-02-06 18:04:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 424 states have (on average 1.4882075471698113) internal successors, (631), 466 states have internal predecessors, (631), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 18:04:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 659 transitions. [2025-02-06 18:04:37,390 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 659 transitions. Word has length 55 [2025-02-06 18:04:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:37,390 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 659 transitions. [2025-02-06 18:04:37,390 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:04:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 659 transitions. [2025-02-06 18:04:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 18:04:37,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:37,391 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:04:37,401 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:04:37,591 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:04:37,592 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1879148725, now seen corresponding path program 1 times [2025-02-06 18:04:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688425046] [2025-02-06 18:04:37,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:37,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 18:04:37,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 18:04:37,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:37,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:37,798 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:04:37,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688425046] [2025-02-06 18:04:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688425046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:37,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:37,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341817199] [2025-02-06 18:04:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:37,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:37,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:37,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:37,800 INFO L87 Difference]: Start difference. First operand 484 states and 659 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:04:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:37,906 INFO L93 Difference]: Finished difference Result 964 states and 1345 transitions. [2025-02-06 18:04:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:37,907 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:04:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:37,909 INFO L225 Difference]: With dead ends: 964 [2025-02-06 18:04:37,909 INFO L226 Difference]: Without dead ends: 580 [2025-02-06 18:04:37,910 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:04:37,910 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 120 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:37,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1042 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-06 18:04:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 526. [2025-02-06 18:04:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 465 states have (on average 1.4774193548387098) internal successors, (687), 507 states have internal predecessors, (687), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 717 transitions. [2025-02-06 18:04:37,926 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 717 transitions. Word has length 60 [2025-02-06 18:04:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:37,926 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 717 transitions. [2025-02-06 18:04:37,927 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:04:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 717 transitions. [2025-02-06 18:04:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 18:04:37,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:37,927 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:04:37,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:04:37,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:37,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1975636023, now seen corresponding path program 1 times [2025-02-06 18:04:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:37,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953038932] [2025-02-06 18:04:37,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:38,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 18:04:38,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 18:04:38,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:38,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:38,140 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:04:38,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953038932] [2025-02-06 18:04:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953038932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:38,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:38,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429594883] [2025-02-06 18:04:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:38,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:38,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:38,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:38,141 INFO L87 Difference]: Start difference. First operand 526 states and 717 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:04:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:38,190 INFO L93 Difference]: Finished difference Result 528 states and 717 transitions. [2025-02-06 18:04:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:38,190 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:04:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:38,193 INFO L225 Difference]: With dead ends: 528 [2025-02-06 18:04:38,194 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 18:04:38,195 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:04:38,195 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:38,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1115 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:04:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 18:04:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-06 18:04:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 465 states have (on average 1.4731182795698925) internal successors, (685), 507 states have internal predecessors, (685), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 715 transitions. [2025-02-06 18:04:38,213 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 715 transitions. Word has length 62 [2025-02-06 18:04:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:38,213 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 715 transitions. [2025-02-06 18:04:38,213 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:04:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 715 transitions. [2025-02-06 18:04:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 18:04:38,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:38,214 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:04:38,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:04:38,214 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:38,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:38,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2114884834, now seen corresponding path program 2 times [2025-02-06 18:04:38,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:38,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828420731] [2025-02-06 18:04:38,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:38,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:38,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-02-06 18:04:38,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-02-06 18:04:38,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:04:38,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:38,504 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:04:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:38,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828420731] [2025-02-06 18:04:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828420731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:38,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:38,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:04:38,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469634296] [2025-02-06 18:04:38,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:38,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:04:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:38,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:04:38,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:04:38,506 INFO L87 Difference]: Start difference. First operand 526 states and 715 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:04:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:38,683 INFO L93 Difference]: Finished difference Result 980 states and 1352 transitions. [2025-02-06 18:04:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:38,684 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:04:38,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:38,690 INFO L225 Difference]: With dead ends: 980 [2025-02-06 18:04:38,690 INFO L226 Difference]: Without dead ends: 526 [2025-02-06 18:04:38,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:04:38,692 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 526 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:38,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 2210 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-06 18:04:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-06 18:04:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 465 states have (on average 1.4709677419354839) internal successors, (684), 507 states have internal predecessors, (684), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 714 transitions. [2025-02-06 18:04:38,718 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 714 transitions. Word has length 63 [2025-02-06 18:04:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:38,724 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 714 transitions. [2025-02-06 18:04:38,724 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:04:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 714 transitions. [2025-02-06 18:04:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 18:04:38,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:38,724 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:04:38,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:04:38,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:38,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:38,726 INFO L85 PathProgramCache]: Analyzing trace with hash 780856039, now seen corresponding path program 2 times [2025-02-06 18:04:38,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:38,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895540376] [2025-02-06 18:04:38,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:38,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:38,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 18:04:39,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 18:04:39,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:39,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:39,576 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:04:39,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:39,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895540376] [2025-02-06 18:04:39,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895540376] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:39,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668947922] [2025-02-06 18:04:39,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:39,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:39,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:39,581 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:04:39,583 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:04:39,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-06 18:04:42,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 18:04:42,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:42,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:42,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:04:42,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 18:04:42,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 18:04:42,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668947922] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:42,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:42,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-02-06 18:04:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649486178] [2025-02-06 18:04:42,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:42,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 18:04:42,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:42,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 18:04:42,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 18:04:42,714 INFO L87 Difference]: Start difference. First operand 526 states and 714 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:04:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:43,064 INFO L93 Difference]: Finished difference Result 1035 states and 1421 transitions. [2025-02-06 18:04:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 18:04:43,064 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-02-06 18:04:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:43,067 INFO L225 Difference]: With dead ends: 1035 [2025-02-06 18:04:43,067 INFO L226 Difference]: Without dead ends: 561 [2025-02-06 18:04:43,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 18:04:43,070 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 9 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:43,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3309 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-06 18:04:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-02-06 18:04:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 501 states have (on average 1.435129740518962) internal successors, (719), 542 states have internal predecessors, (719), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 749 transitions. [2025-02-06 18:04:43,086 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 749 transitions. Word has length 73 [2025-02-06 18:04:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:43,086 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 749 transitions. [2025-02-06 18:04:43,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:04:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 749 transitions. [2025-02-06 18:04:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 18:04:43,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:43,087 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:43,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 18:04:43,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 18:04:43,288 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:43,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 515057706, now seen corresponding path program 1 times [2025-02-06 18:04:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:43,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171306585] [2025-02-06 18:04:43,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:43,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:04:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:04:43,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:43,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171306585] [2025-02-06 18:04:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171306585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736900928] [2025-02-06 18:04:43,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:43,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:43,974 INFO L229 MonitoredProcess]: Starting monitored process 10 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:04:43,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 18:04:44,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:04:44,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:04:44,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:44,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:44,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:04:44,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:44,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:44,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736900928] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:44,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:44,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 18:04:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953401003] [2025-02-06 18:04:44,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:44,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:04:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:44,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:04:44,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:04:44,723 INFO L87 Difference]: Start difference. First operand 561 states and 749 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:04:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:45,290 INFO L93 Difference]: Finished difference Result 3936 states and 5665 transitions. [2025-02-06 18:04:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:04:45,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-02-06 18:04:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:45,319 INFO L225 Difference]: With dead ends: 3936 [2025-02-06 18:04:45,322 INFO L226 Difference]: Without dead ends: 3935 [2025-02-06 18:04:45,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:04:45,325 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 7753 mSDsluCounter, 5981 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7823 SdHoareTripleChecker+Valid, 6534 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:45,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7823 Valid, 6534 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:04:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2025-02-06 18:04:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 585. [2025-02-06 18:04:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 525 states have (on average 1.4266666666666667) internal successors, (749), 566 states have internal predecessors, (749), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 779 transitions. [2025-02-06 18:04:45,413 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 779 transitions. Word has length 97 [2025-02-06 18:04:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:45,414 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 779 transitions. [2025-02-06 18:04:45,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:04:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 779 transitions. [2025-02-06 18:04:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:04:45,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:45,415 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:45,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 18:04:45,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:45,619 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:45,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1665592759, now seen corresponding path program 1 times [2025-02-06 18:04:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795891516] [2025-02-06 18:04:45,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:45,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:04:45,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:04:45,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:45,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795891516] [2025-02-06 18:04:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795891516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:46,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:46,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272594386] [2025-02-06 18:04:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:46,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:46,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:46,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:46,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:46,012 INFO L87 Difference]: Start difference. First operand 585 states and 779 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:46,211 INFO L93 Difference]: Finished difference Result 966 states and 1336 transitions. [2025-02-06 18:04:46,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:46,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-06 18:04:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:46,214 INFO L225 Difference]: With dead ends: 966 [2025-02-06 18:04:46,217 INFO L226 Difference]: Without dead ends: 638 [2025-02-06 18:04:46,218 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:04:46,218 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 75 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:46,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1097 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-06 18:04:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 588. [2025-02-06 18:04:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 530 states have (on average 1.420754716981132) internal successors, (753), 569 states have internal predecessors, (753), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 783 transitions. [2025-02-06 18:04:46,253 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 783 transitions. Word has length 103 [2025-02-06 18:04:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:46,257 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 783 transitions. [2025-02-06 18:04:46,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 783 transitions. [2025-02-06 18:04:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:04:46,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:46,257 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:46,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:04:46,258 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1669869434, now seen corresponding path program 1 times [2025-02-06 18:04:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934481637] [2025-02-06 18:04:46,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:46,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:04:46,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:04:46,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:46,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934481637] [2025-02-06 18:04:46,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934481637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:46,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:46,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391645969] [2025-02-06 18:04:46,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:46,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:46,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:46,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:46,803 INFO L87 Difference]: Start difference. First operand 588 states and 783 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:46,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:46,905 INFO L93 Difference]: Finished difference Result 642 states and 862 transitions. [2025-02-06 18:04:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:46,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-06 18:04:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:46,908 INFO L225 Difference]: With dead ends: 642 [2025-02-06 18:04:46,908 INFO L226 Difference]: Without dead ends: 639 [2025-02-06 18:04:46,908 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:04:46,909 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 190 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:46,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 911 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-06 18:04:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 585. [2025-02-06 18:04:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 530 states have (on average 1.4150943396226414) internal successors, (750), 566 states have internal predecessors, (750), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 780 transitions. [2025-02-06 18:04:46,930 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 780 transitions. Word has length 103 [2025-02-06 18:04:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:46,930 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 780 transitions. [2025-02-06 18:04:46,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 780 transitions. [2025-02-06 18:04:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:04:46,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:46,931 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:46,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:04:46,931 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:46,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 93768500, now seen corresponding path program 1 times [2025-02-06 18:04:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:46,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190807658] [2025-02-06 18:04:46,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:47,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:04:47,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:04:47,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:47,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:47,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:47,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190807658] [2025-02-06 18:04:47,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190807658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:47,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:47,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:47,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916886678] [2025-02-06 18:04:47,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:47,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:47,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:47,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:47,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:47,146 INFO L87 Difference]: Start difference. First operand 585 states and 780 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:47,245 INFO L93 Difference]: Finished difference Result 968 states and 1338 transitions. [2025-02-06 18:04:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:47,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 18:04:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:47,250 INFO L225 Difference]: With dead ends: 968 [2025-02-06 18:04:47,250 INFO L226 Difference]: Without dead ends: 636 [2025-02-06 18:04:47,251 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:04:47,252 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 156 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:47,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1030 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-02-06 18:04:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 570. [2025-02-06 18:04:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 519 states have (on average 1.4065510597302504) internal successors, (730), 551 states have internal predecessors, (730), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 760 transitions. [2025-02-06 18:04:47,273 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 760 transitions. Word has length 104 [2025-02-06 18:04:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:47,274 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 760 transitions. [2025-02-06 18:04:47,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 760 transitions. [2025-02-06 18:04:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 18:04:47,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:47,276 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 18:04:47,277 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:47,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 226345464, now seen corresponding path program 1 times [2025-02-06 18:04:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76692364] [2025-02-06 18:04:47,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:47,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 18:04:47,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 18:04:47,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:47,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:47,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:47,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76692364] [2025-02-06 18:04:47,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76692364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:47,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:47,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:47,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640214554] [2025-02-06 18:04:47,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:47,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:47,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:47,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:47,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:47,531 INFO L87 Difference]: Start difference. First operand 570 states and 760 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:47,655 INFO L93 Difference]: Finished difference Result 624 states and 839 transitions. [2025-02-06 18:04:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:47,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-06 18:04:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:47,658 INFO L225 Difference]: With dead ends: 624 [2025-02-06 18:04:47,658 INFO L226 Difference]: Without dead ends: 623 [2025-02-06 18:04:47,659 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:04:47,659 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 187 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:47,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 964 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-02-06 18:04:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 569. [2025-02-06 18:04:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 519 states have (on average 1.4046242774566473) internal successors, (729), 550 states have internal predecessors, (729), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 759 transitions. [2025-02-06 18:04:47,675 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 759 transitions. Word has length 104 [2025-02-06 18:04:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:47,675 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 759 transitions. [2025-02-06 18:04:47,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 759 transitions. [2025-02-06 18:04:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 18:04:47,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:47,679 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:47,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:04:47,679 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:47,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 986255140, now seen corresponding path program 1 times [2025-02-06 18:04:47,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:47,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355562253] [2025-02-06 18:04:47,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:47,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:04:47,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:04:47,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:47,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:47,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355562253] [2025-02-06 18:04:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355562253] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065108897] [2025-02-06 18:04:47,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:47,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:47,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:47,957 INFO L229 MonitoredProcess]: Starting monitored process 11 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:04:47,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 18:04:48,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:04:48,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:04:48,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:48,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:04:48,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-06 18:04:48,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:04:48,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065108897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:48,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:04:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 18:04:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432163053] [2025-02-06 18:04:48,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:48,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:04:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:48,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:04:48,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:04:48,657 INFO L87 Difference]: Start difference. First operand 569 states and 759 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:04:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:48,881 INFO L93 Difference]: Finished difference Result 1068 states and 1474 transitions. [2025-02-06 18:04:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:04:48,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-02-06 18:04:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:48,884 INFO L225 Difference]: With dead ends: 1068 [2025-02-06 18:04:48,884 INFO L226 Difference]: Without dead ends: 686 [2025-02-06 18:04:48,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:04:48,890 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 287 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:48,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2122 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:04:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-06 18:04:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 568. [2025-02-06 18:04:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 520 states have (on average 1.396153846153846) internal successors, (726), 549 states have internal predecessors, (726), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 756 transitions. [2025-02-06 18:04:48,977 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 756 transitions. Word has length 105 [2025-02-06 18:04:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:48,978 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 756 transitions. [2025-02-06 18:04:48,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:04:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 756 transitions. [2025-02-06 18:04:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 18:04:48,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:48,983 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:48,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 18:04:49,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 18:04:49,184 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:49,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -343632929, now seen corresponding path program 1 times [2025-02-06 18:04:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:49,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880443645] [2025-02-06 18:04:49,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:49,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 18:04:49,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 18:04:49,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:49,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-02-06 18:04:49,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:49,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880443645] [2025-02-06 18:04:49,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880443645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:49,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:49,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:04:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878494579] [2025-02-06 18:04:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:49,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:04:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:49,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:04:49,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:04:49,720 INFO L87 Difference]: Start difference. First operand 568 states and 756 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:49,810 INFO L93 Difference]: Finished difference Result 568 states and 756 transitions. [2025-02-06 18:04:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:04:49,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-02-06 18:04:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:49,813 INFO L225 Difference]: With dead ends: 568 [2025-02-06 18:04:49,813 INFO L226 Difference]: Without dead ends: 567 [2025-02-06 18:04:49,813 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:04:49,813 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 1 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:49,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1089 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-06 18:04:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-06 18:04:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 520 states have (on average 1.3942307692307692) internal successors, (725), 548 states have internal predecessors, (725), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:04:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 755 transitions. [2025-02-06 18:04:49,832 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 755 transitions. Word has length 108 [2025-02-06 18:04:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 755 transitions. [2025-02-06 18:04:49,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 755 transitions. [2025-02-06 18:04:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 18:04:49,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:49,834 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:49,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 18:04:49,834 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:49,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash -2062685449, now seen corresponding path program 1 times [2025-02-06 18:04:49,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:49,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934433762] [2025-02-06 18:04:49,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:49,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 18:04:50,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 18:04:50,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:50,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:50,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:50,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934433762] [2025-02-06 18:04:50,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934433762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:04:50,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:04:50,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:04:50,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870833068] [2025-02-06 18:04:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:04:50,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:04:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:50,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:04:50,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:04:50,397 INFO L87 Difference]: Start difference. First operand 567 states and 755 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:50,482 INFO L93 Difference]: Finished difference Result 986 states and 1349 transitions. [2025-02-06 18:04:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:04:50,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-02-06 18:04:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:50,489 INFO L225 Difference]: With dead ends: 986 [2025-02-06 18:04:50,489 INFO L226 Difference]: Without dead ends: 573 [2025-02-06 18:04:50,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:04:50,490 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 4 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:50,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1629 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-06 18:04:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 572. [2025-02-06 18:04:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 524 states have (on average 1.3950381679389312) internal successors, (731), 552 states have internal predecessors, (731), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-02-06 18:04:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 762 transitions. [2025-02-06 18:04:50,514 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 762 transitions. Word has length 109 [2025-02-06 18:04:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:50,514 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 762 transitions. [2025-02-06 18:04:50,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:04:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 762 transitions. [2025-02-06 18:04:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 18:04:50,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:50,515 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:50,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 18:04:50,516 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:50,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash 630722122, now seen corresponding path program 1 times [2025-02-06 18:04:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:50,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453130535] [2025-02-06 18:04:50,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:50,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:50,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:04:50,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:04:50,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:50,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453130535] [2025-02-06 18:04:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453130535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:51,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910253137] [2025-02-06 18:04:51,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:51,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:51,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:51,129 INFO L229 MonitoredProcess]: Starting monitored process 12 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:04:51,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 18:04:51,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:04:52,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:04:52,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:52,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:52,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:04:52,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:52,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:52,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910253137] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:52,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:52,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 18:04:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027773973] [2025-02-06 18:04:52,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:52,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:04:52,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:52,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:04:52,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:04:52,207 INFO L87 Difference]: Start difference. First operand 572 states and 762 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:04:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:52,422 INFO L93 Difference]: Finished difference Result 1003 states and 1375 transitions. [2025-02-06 18:04:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:04:52,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 110 [2025-02-06 18:04:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:52,424 INFO L225 Difference]: With dead ends: 1003 [2025-02-06 18:04:52,425 INFO L226 Difference]: Without dead ends: 585 [2025-02-06 18:04:52,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:04:52,426 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 4 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:52,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2721 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-06 18:04:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 580. [2025-02-06 18:04:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 530 states have (on average 1.3981132075471698) internal successors, (741), 560 states have internal predecessors, (741), 17 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 18:04:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 775 transitions. [2025-02-06 18:04:52,445 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 775 transitions. Word has length 110 [2025-02-06 18:04:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:52,445 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 775 transitions. [2025-02-06 18:04:52,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:04:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 775 transitions. [2025-02-06 18:04:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 18:04:52,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:52,447 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:52,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 18:04:52,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 18:04:52,652 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash 890619668, now seen corresponding path program 1 times [2025-02-06 18:04:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:52,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578878409] [2025-02-06 18:04:52,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:52,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:04:52,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:04:52,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:52,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 18:04:53,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:53,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578878409] [2025-02-06 18:04:53,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578878409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:53,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960749311] [2025-02-06 18:04:53,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:04:53,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:53,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:53,030 INFO L229 MonitoredProcess]: Starting monitored process 13 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:04:53,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 18:04:53,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 18:04:53,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 18:04:53,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:04:53,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:53,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 18:04:53,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 18:04:53,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:04:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 18:04:53,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960749311] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:04:53,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:04:53,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 18:04:53,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402402135] [2025-02-06 18:04:53,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:04:53,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:04:53,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:04:53,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:04:53,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:53,962 INFO L87 Difference]: Start difference. First operand 580 states and 775 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:04:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:04:54,060 INFO L93 Difference]: Finished difference Result 683 states and 886 transitions. [2025-02-06 18:04:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:04:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-02-06 18:04:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:04:54,063 INFO L225 Difference]: With dead ends: 683 [2025-02-06 18:04:54,063 INFO L226 Difference]: Without dead ends: 682 [2025-02-06 18:04:54,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:04:54,064 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:04:54,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1095 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:04:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-06 18:04:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-02-06 18:04:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 632 states have (on average 1.3433544303797469) internal successors, (849), 662 states have internal predecessors, (849), 17 states have call successors, (17), 6 states have call predecessors, (17), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-06 18:04:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 883 transitions. [2025-02-06 18:04:54,094 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 883 transitions. Word has length 110 [2025-02-06 18:04:54,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:04:54,094 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 883 transitions. [2025-02-06 18:04:54,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:04:54,094 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 883 transitions. [2025-02-06 18:04:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-06 18:04:54,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:04:54,095 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:04:54,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 18:04:54,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 18:04:54,296 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-06 18:04:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:04:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1747298231, now seen corresponding path program 2 times [2025-02-06 18:04:54,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:04:54,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226986215] [2025-02-06 18:04:54,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:04:54,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-02-06 18:04:54,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 18:04:54,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:54,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-06 18:04:55,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:04:55,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226986215] [2025-02-06 18:04:55,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226986215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:04:55,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872300746] [2025-02-06 18:04:55,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:04:55,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:04:55,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:04:55,046 INFO L229 MonitoredProcess]: Starting monitored process 14 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:04:55,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 18:04:55,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-02-06 18:04:57,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 18:04:57,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:04:57,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:04:57,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-06 18:04:57,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:04:57,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,367 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 18:04:57,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 18:04:57,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,744 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 18:04:57,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 18:04:57,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:57,799 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-06 18:04:57,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-06 18:04:57,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 132 [2025-02-06 18:04:57,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-02-06 18:04:57,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,882 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-02-06 18:04:57,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2025-02-06 18:04:57,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 26 [2025-02-06 18:04:57,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 144 [2025-02-06 18:04:57,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,912 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-02-06 18:04:57,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 89 [2025-02-06 18:04:57,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-02-06 18:04:57,940 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-02-06 18:04:57,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-02-06 18:04:57,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-02-06 18:04:57,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 106 [2025-02-06 18:04:57,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,969 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-02-06 18:04:57,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 78 [2025-02-06 18:04:57,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 100 [2025-02-06 18:04:57,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:57,985 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-02-06 18:04:57,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2025-02-06 18:04:58,017 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,053 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,085 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,122 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,158 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,193 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,226 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,257 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,290 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-06 18:04:58,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-06 18:04:58,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-06 18:04:58,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-02-06 18:04:58,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 18:04:58,477 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset_#t~loopctr286_15| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_15| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_15| 1) |c_#Ultimate.C_memset_#t~loopctr286|) (<= 1 |v_#Ultimate.C_memset_#t~loopctr286_15|))) is different from true [2025-02-06 18:04:58,495 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset_#t~loopctr286_15| Int) (|v_#Ultimate.C_memset_#t~loopctr286_16| Int)) (and (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_16| 1) |c_#Ultimate.C_memset_#t~loopctr286|) (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_15| 1) |v_#Ultimate.C_memset_#t~loopctr286_16|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_15| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_16| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memset_#t~loopctr286_15|))) is different from true [2025-02-06 18:04:58,511 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memset_#t~loopctr286_17| Int) (|v_#Ultimate.C_memset_#t~loopctr286_15| Int) (|#Ultimate.C_memset_#ptr.base| Int) (|v_#Ultimate.C_memset_#t~loopctr286_16| Int)) (and (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_15| 1) |v_#Ultimate.C_memset_#t~loopctr286_16|) (<= (+ |v_#Ultimate.C_memset_#t~loopctr286_16| 1) |v_#Ultimate.C_memset_#t~loopctr286_17|) (<= 1 |v_#Ultimate.C_memset_#t~loopctr286_15|) (= (store |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base| (store (store (store (store (select |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_15| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_16| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|) (+ |v_#Ultimate.C_memset_#t~loopctr286_17| |c_#Ultimate.C_memset_#ptr.offset|) |c_#Ultimate.C_memset_#value|)) |c_#memory_int|))) is different from true [2025-02-06 18:04:58,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:58,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:58,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:58,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:58,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:58,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:04:58,556 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 18:04:58,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 43 [2025-02-06 18:04:59,018 INFO L349 Elim1Store]: treesize reduction 72, result has 74.7 percent of original size [2025-02-06 18:04:59,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 272 [2025-02-06 18:05:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 241 trivial. 9 not checked. [2025-02-06 18:05:04,077 INFO L312 TraceCheckSpWp]: Computing backward predicates...