./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 551b0097 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-?-551b009-m [2025-01-10 06:07:16,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:07:16,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:07:16,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:07:16,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:07:17,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:07:17,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:07:17,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:07:17,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:07:17,001 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:07:17,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:07:17,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:07:17,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:07:17,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:07:17,002 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:07:17,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:07:17,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:07:17,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:07:17,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:07:17,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:07:17,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:07:17,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:07:17,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:07:17,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:07:17,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:07:17,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:07:17,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:07:17,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:07:17,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:07:17,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:07:17,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:07:17,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:07:17,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:07:17,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:07:17,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:07:17,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:07:17,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:07:17,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:07:17,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:07:17,005 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-01-10 06:07:17,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:07:17,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:07:17,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:07:17,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:07:17,279 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:07:17,281 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-01-10 06:07:18,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01b25d93e/f08dc888768a48f4b72380b0c407d242/FLAG9edbf1492 [2025-01-10 06:07:18,988 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:07:18,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/who-2.i [2025-01-10 06:07:19,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01b25d93e/f08dc888768a48f4b72380b0c407d242/FLAG9edbf1492 [2025-01-10 06:07:19,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01b25d93e/f08dc888768a48f4b72380b0c407d242 [2025-01-10 06:07:19,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:07:19,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:07:19,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:07:19,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:07:19,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:07:19,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:07:19" (1/1) ... [2025-01-10 06:07:19,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b84b54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:19, skipping insertion in model container [2025-01-10 06:07:19,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:07:19" (1/1) ... [2025-01-10 06:07:19,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:07:20,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:07:20,281 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:07:20,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:07:20,610 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:07:20,617 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:07:20,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20 WrapperNode [2025-01-10 06:07:20,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:07:20,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:07:20,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:07:20,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:07:20,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,757 INFO L138 Inliner]: procedures = 639, calls = 723, calls flagged for inlining = 29, calls inlined = 28, statements flattened = 1971 [2025-01-10 06:07:20,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:07:20,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:07:20,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:07:20,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:07:20,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,818 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:07:20,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,901 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:07:20,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:07:20,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:07:20,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:07:20,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (1/1) ... [2025-01-10 06:07:20,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:07:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:20,997 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-01-10 06:07:20,999 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-01-10 06:07:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:07:21,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:07:21,015 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:07:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-01-10 06:07:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-01-10 06:07:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:07:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:07:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 06:07:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 06:07:21,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:07:21,321 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:07:21,323 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:07:23,111 INFO L? ?]: Removed 611 outVars from TransFormulas that were not future-live. [2025-01-10 06:07:23,111 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:07:23,134 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:07:23,138 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 06:07:23,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:07:23 BoogieIcfgContainer [2025-01-10 06:07:23,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:07:23,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:07:23,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:07:23,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:07:23,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:07:19" (1/3) ... [2025-01-10 06:07:23,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d6ae45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:07:23, skipping insertion in model container [2025-01-10 06:07:23,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:20" (2/3) ... [2025-01-10 06:07:23,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d6ae45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:07:23, skipping insertion in model container [2025-01-10 06:07:23,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:07:23" (3/3) ... [2025-01-10 06:07:23,149 INFO L128 eAbstractionObserver]: Analyzing ICFG who-2.i [2025-01-10 06:07:23,161 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:07:23,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG who-2.i that has 6 procedures, 516 locations, 1 initial locations, 33 loop locations, and 70 error locations. [2025-01-10 06:07:23,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:07:23,236 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;@1a7ce603, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:07:23,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-01-10 06:07:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 516 states, 420 states have (on average 1.6666666666666667) internal successors, (700), 491 states have internal predecessors, (700), 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-01-10 06:07:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:07:23,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:23,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:07:23,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:23,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash 8498500, now seen corresponding path program 1 times [2025-01-10 06:07:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024948514] [2025-01-10 06:07:23,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:23,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:07:23,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:07:23,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:23,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:07:23,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:23,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024948514] [2025-01-10 06:07:23,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024948514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:23,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:23,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343551529] [2025-01-10 06:07:23,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:23,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:23,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:23,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:23,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:23,971 INFO L87 Difference]: Start difference. First operand has 516 states, 420 states have (on average 1.6666666666666667) internal successors, (700), 491 states have internal predecessors, (700), 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-01-10 06:07:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:24,063 INFO L93 Difference]: Finished difference Result 945 states and 1382 transitions. [2025-01-10 06:07:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:24,066 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-01-10 06:07:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:24,076 INFO L225 Difference]: With dead ends: 945 [2025-01-10 06:07:24,076 INFO L226 Difference]: Without dead ends: 430 [2025-01-10 06:07:24,082 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-01-10 06:07:24,086 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:24,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1189 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-10 06:07:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-01-10 06:07:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 361 states have (on average 1.5817174515235457) 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-01-10 06:07:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 599 transitions. [2025-01-10 06:07:24,148 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 599 transitions. Word has length 4 [2025-01-10 06:07:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:24,148 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 599 transitions. [2025-01-10 06:07:24,148 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-01-10 06:07:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 599 transitions. [2025-01-10 06:07:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:07:24,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:24,148 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:07:24,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:07:24,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:24,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash -223973092, now seen corresponding path program 1 times [2025-01-10 06:07:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:24,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904449524] [2025-01-10 06:07:24,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:24,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:07:24,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:07:24,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:24,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:07:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:24,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904449524] [2025-01-10 06:07:24,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904449524] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468449184] [2025-01-10 06:07:24,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:24,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:24,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:24,446 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-01-10 06:07:24,464 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-01-10 06:07:24,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:07:24,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:07:24,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:24,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:24,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:07:24,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:07:24,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:07:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468449184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:24,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:07:24,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:07:24,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761275648] [2025-01-10 06:07:24,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:24,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:07:24,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:24,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:07:24,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:07:24,891 INFO L87 Difference]: Start difference. First operand 430 states and 599 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-01-10 06:07:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:24,951 INFO L93 Difference]: Finished difference Result 430 states and 599 transitions. [2025-01-10 06:07:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:07:24,951 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-01-10 06:07:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:24,957 INFO L225 Difference]: With dead ends: 430 [2025-01-10 06:07:24,957 INFO L226 Difference]: Without dead ends: 429 [2025-01-10 06:07:24,958 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-01-10 06:07:24,958 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:24,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1768 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-01-10 06:07:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-01-10 06:07:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 361 states have (on average 1.5789473684210527) 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-01-10 06:07:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 598 transitions. [2025-01-10 06:07:24,984 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 598 transitions. Word has length 7 [2025-01-10 06:07:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:24,984 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 598 transitions. [2025-01-10 06:07:24,984 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-01-10 06:07:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 598 transitions. [2025-01-10 06:07:24,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:07:24,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:24,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:07:24,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:07:25,185 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-01-10 06:07:25,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:25,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1646769026, now seen corresponding path program 1 times [2025-01-10 06:07:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:25,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551760274] [2025-01-10 06:07:25,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:25,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:07:25,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:07:25,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:25,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:07:25,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551760274] [2025-01-10 06:07:25,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551760274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:25,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953370371] [2025-01-10 06:07:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:25,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:25,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:25,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:25,410 INFO L87 Difference]: Start difference. First operand 429 states and 598 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-01-10 06:07:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:25,428 INFO L93 Difference]: Finished difference Result 429 states and 598 transitions. [2025-01-10 06:07:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:25,428 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-01-10 06:07:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:25,430 INFO L225 Difference]: With dead ends: 429 [2025-01-10 06:07:25,430 INFO L226 Difference]: Without dead ends: 428 [2025-01-10 06:07:25,430 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-01-10 06:07:25,431 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:25,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:25,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-10 06:07:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2025-01-10 06:07:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 359 states have (on average 1.5793871866295264) 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-01-10 06:07:25,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 595 transitions. [2025-01-10 06:07:25,455 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 595 transitions. Word has length 8 [2025-01-10 06:07:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:25,455 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 595 transitions. [2025-01-10 06:07:25,455 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-01-10 06:07:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 595 transitions. [2025-01-10 06:07:25,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:07:25,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:25,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:07:25,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:07:25,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:25,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1225092800, now seen corresponding path program 1 times [2025-01-10 06:07:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:25,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067477218] [2025-01-10 06:07:25,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:25,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:25,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:07:25,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:07:25,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:25,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:07:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067477218] [2025-01-10 06:07:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067477218] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655536114] [2025-01-10 06:07:25,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:25,755 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-01-10 06:07:25,765 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-01-10 06:07:26,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:07:26,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:07:26,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:26,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:07:26,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:26,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:07:26,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:07:26,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655536114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:26,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:07:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:07:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910342577] [2025-01-10 06:07:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:26,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:26,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:26,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:07:26,211 INFO L87 Difference]: Start difference. First operand 426 states and 595 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-01-10 06:07:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:26,244 INFO L93 Difference]: Finished difference Result 426 states and 595 transitions. [2025-01-10 06:07:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:26,244 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-01-10 06:07:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:26,246 INFO L225 Difference]: With dead ends: 426 [2025-01-10 06:07:26,246 INFO L226 Difference]: Without dead ends: 424 [2025-01-10 06:07:26,247 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-01-10 06:07:26,247 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 531 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:26,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 628 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-10 06:07:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-01-10 06:07:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 359 states have (on average 1.573816155988858) internal successors, (565), 406 states have internal predecessors, (565), 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-01-10 06:07:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 593 transitions. [2025-01-10 06:07:26,264 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 593 transitions. Word has length 12 [2025-01-10 06:07:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:26,265 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 593 transitions. [2025-01-10 06:07:26,265 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-01-10 06:07:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 593 transitions. [2025-01-10 06:07:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:07:26,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:26,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:07:26,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:07:26,467 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-01-10 06:07:26,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:26,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 676829157, now seen corresponding path program 1 times [2025-01-10 06:07:26,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:26,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799908865] [2025-01-10 06:07:26,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:26,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:26,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:07:26,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:07:26,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:26,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:07:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799908865] [2025-01-10 06:07:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799908865] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666605373] [2025-01-10 06:07:26,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:26,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:26,776 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-01-10 06:07:26,806 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-01-10 06:07:27,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:07:27,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:07:27,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:27,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:27,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:07:27,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:07:27,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:07:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:07:27,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666605373] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:07:27,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:07:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:07:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006501727] [2025-01-10 06:07:27,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:07:27,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:07:27,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:27,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:07:27,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:07:27,230 INFO L87 Difference]: Start difference. First operand 424 states and 593 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-01-10 06:07:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:27,274 INFO L93 Difference]: Finished difference Result 851 states and 1191 transitions. [2025-01-10 06:07:27,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:07:27,275 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-01-10 06:07:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:27,277 INFO L225 Difference]: With dead ends: 851 [2025-01-10 06:07:27,277 INFO L226 Difference]: Without dead ends: 433 [2025-01-10 06:07:27,278 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-01-10 06:07:27,278 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 4 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:27,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1763 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:27,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-10 06:07:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-01-10 06:07:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 368 states have (on average 1.559782608695652) internal successors, (574), 415 states have internal predecessors, (574), 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-01-10 06:07:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 602 transitions. [2025-01-10 06:07:27,289 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 602 transitions. Word has length 13 [2025-01-10 06:07:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:27,290 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 602 transitions. [2025-01-10 06:07:27,290 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-01-10 06:07:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 602 transitions. [2025-01-10 06:07:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:07:27,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:27,290 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:07:27,300 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-01-10 06:07:27,491 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-01-10 06:07:27,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash -957646835, now seen corresponding path program 2 times [2025-01-10 06:07:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37238065] [2025-01-10 06:07:27,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:07:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:27,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:07:27,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:07:27,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:07:27,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:07:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:27,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37238065] [2025-01-10 06:07:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37238065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:27,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:07:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194870754] [2025-01-10 06:07:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:27,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:07:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:27,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:07:27,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:07:27,968 INFO L87 Difference]: Start difference. First operand 433 states and 602 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-01-10 06:07:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:28,033 INFO L93 Difference]: Finished difference Result 433 states and 602 transitions. [2025-01-10 06:07:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:07:28,033 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-01-10 06:07:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:28,035 INFO L225 Difference]: With dead ends: 433 [2025-01-10 06:07:28,035 INFO L226 Difference]: Without dead ends: 431 [2025-01-10 06:07:28,036 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-01-10 06:07:28,036 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 530 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1767 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-01-10 06:07:28,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1767 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-10 06:07:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-01-10 06:07:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 368 states have (on average 1.5543478260869565) internal successors, (572), 413 states have internal predecessors, (572), 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-01-10 06:07:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 600 transitions. [2025-01-10 06:07:28,048 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 600 transitions. Word has length 22 [2025-01-10 06:07:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:28,048 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 600 transitions. [2025-01-10 06:07:28,048 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-01-10 06:07:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 600 transitions. [2025-01-10 06:07:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:07:28,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:28,049 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:07:28,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:07:28,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:28,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:28,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1065930752, now seen corresponding path program 1 times [2025-01-10 06:07:28,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:28,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764389452] [2025-01-10 06:07:28,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:28,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:07:28,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:07:28,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:28,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:07:28,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764389452] [2025-01-10 06:07:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764389452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:28,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:28,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:28,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692027212] [2025-01-10 06:07:28,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:28,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:28,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:28,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:28,283 INFO L87 Difference]: Start difference. First operand 431 states and 600 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-01-10 06:07:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:28,309 INFO L93 Difference]: Finished difference Result 845 states and 1184 transitions. [2025-01-10 06:07:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:28,310 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-01-10 06:07:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:28,312 INFO L225 Difference]: With dead ends: 845 [2025-01-10 06:07:28,312 INFO L226 Difference]: Without dead ends: 434 [2025-01-10 06:07:28,312 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-01-10 06:07:28,313 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 1 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:28,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1169 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-10 06:07:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2025-01-10 06:07:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 371 states have (on average 1.5498652291105122) internal successors, (575), 416 states have internal predecessors, (575), 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-01-10 06:07:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 603 transitions. [2025-01-10 06:07:28,325 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 603 transitions. Word has length 27 [2025-01-10 06:07:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:28,325 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 603 transitions. [2025-01-10 06:07:28,325 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-01-10 06:07:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 603 transitions. [2025-01-10 06:07:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 06:07:28,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:28,326 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-01-10 06:07:28,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:07:28,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:28,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1316377944, now seen corresponding path program 1 times [2025-01-10 06:07:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955591766] [2025-01-10 06:07:28,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:28,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:07:28,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:07:28,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:28,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:07:28,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:28,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955591766] [2025-01-10 06:07:28,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955591766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:28,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:28,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:28,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791277607] [2025-01-10 06:07:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:28,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:28,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:28,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:28,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:28,541 INFO L87 Difference]: Start difference. First operand 434 states and 603 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-01-10 06:07:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:28,582 INFO L93 Difference]: Finished difference Result 739 states and 1048 transitions. [2025-01-10 06:07:28,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:28,582 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-01-10 06:07:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:28,585 INFO L225 Difference]: With dead ends: 739 [2025-01-10 06:07:28,585 INFO L226 Difference]: Without dead ends: 737 [2025-01-10 06:07:28,586 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-01-10 06:07:28,586 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 419 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:28,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1156 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-01-10 06:07:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 438. [2025-01-10 06:07:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 375 states have (on average 1.5466666666666666) internal successors, (580), 420 states have internal predecessors, (580), 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-01-10 06:07:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 608 transitions. [2025-01-10 06:07:28,601 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 608 transitions. Word has length 28 [2025-01-10 06:07:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:28,602 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 608 transitions. [2025-01-10 06:07:28,602 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-01-10 06:07:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 608 transitions. [2025-01-10 06:07:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:07:28,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:28,602 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-01-10 06:07:28,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:07:28,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:28,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1845460503, now seen corresponding path program 1 times [2025-01-10 06:07:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140527805] [2025-01-10 06:07:28,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:28,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:07:28,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:07:28,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:28,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:07:28,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:28,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140527805] [2025-01-10 06:07:28,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140527805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:28,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577495498] [2025-01-10 06:07:28,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:28,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:28,865 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-01-10 06:07:28,873 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-01-10 06:07:29,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:07:29,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:07:29,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:29,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:29,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:07:29,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:07:29,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:07:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:07:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577495498] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:07:29,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:07:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:07:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345722328] [2025-01-10 06:07:29,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:07:29,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:07:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:29,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:07:29,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:07:29,464 INFO L87 Difference]: Start difference. First operand 438 states and 608 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-01-10 06:07:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:29,565 INFO L93 Difference]: Finished difference Result 878 states and 1224 transitions. [2025-01-10 06:07:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:07:29,566 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-01-10 06:07:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:29,567 INFO L225 Difference]: With dead ends: 878 [2025-01-10 06:07:29,568 INFO L226 Difference]: Without dead ends: 455 [2025-01-10 06:07:29,568 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-01-10 06:07:29,569 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 5 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:29,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2897 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-01-10 06:07:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-01-10 06:07:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 393 states have (on average 1.5190839694656488) internal successors, (597), 437 states have internal predecessors, (597), 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-01-10 06:07:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 625 transitions. [2025-01-10 06:07:29,581 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 625 transitions. Word has length 30 [2025-01-10 06:07:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:29,585 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 625 transitions. [2025-01-10 06:07:29,585 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-01-10 06:07:29,585 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 625 transitions. [2025-01-10 06:07:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:07:29,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:29,585 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-01-10 06:07:29,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:07:29,786 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-01-10 06:07:29,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:29,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1687777751, now seen corresponding path program 1 times [2025-01-10 06:07:29,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:29,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396235494] [2025-01-10 06:07:29,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:29,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:07:29,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:07:29,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:29,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:07:29,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396235494] [2025-01-10 06:07:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396235494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:29,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:29,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:29,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266234968] [2025-01-10 06:07:29,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:29,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:29,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:29,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:29,998 INFO L87 Difference]: Start difference. First operand 455 states and 625 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-01-10 06:07:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:30,088 INFO L93 Difference]: Finished difference Result 467 states and 639 transitions. [2025-01-10 06:07:30,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:30,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:07:30,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:30,091 INFO L225 Difference]: With dead ends: 467 [2025-01-10 06:07:30,091 INFO L226 Difference]: Without dead ends: 465 [2025-01-10 06:07:30,091 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-01-10 06:07:30,092 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 2 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:30,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1164 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-10 06:07:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2025-01-10 06:07:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 402 states have (on average 1.5149253731343284) internal successors, (609), 446 states have internal predecessors, (609), 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-01-10 06:07:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 637 transitions. [2025-01-10 06:07:30,103 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 637 transitions. Word has length 48 [2025-01-10 06:07:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 637 transitions. [2025-01-10 06:07:30,104 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-01-10 06:07:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 637 transitions. [2025-01-10 06:07:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:07:30,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:30,104 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-01-10 06:07:30,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:07:30,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:30,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash 781497086, now seen corresponding path program 1 times [2025-01-10 06:07:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:30,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257935667] [2025-01-10 06:07:30,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:30,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:07:30,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:07:30,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:30,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:07:30,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257935667] [2025-01-10 06:07:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257935667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:30,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:30,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174388337] [2025-01-10 06:07:30,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:30,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:30,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:30,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:30,293 INFO L87 Difference]: Start difference. First operand 464 states and 637 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-01-10 06:07:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:30,311 INFO L93 Difference]: Finished difference Result 464 states and 637 transitions. [2025-01-10 06:07:30,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:30,312 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-01-10 06:07:30,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:30,314 INFO L225 Difference]: With dead ends: 464 [2025-01-10 06:07:30,314 INFO L226 Difference]: Without dead ends: 463 [2025-01-10 06:07:30,314 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-01-10 06:07:30,314 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 0 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:30,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1167 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-10 06:07:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 459. [2025-01-10 06:07:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 398 states have (on average 1.515075376884422) internal successors, (603), 441 states have internal predecessors, (603), 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-01-10 06:07:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 631 transitions. [2025-01-10 06:07:30,326 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 631 transitions. Word has length 49 [2025-01-10 06:07:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:30,326 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 631 transitions. [2025-01-10 06:07:30,326 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-01-10 06:07:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 631 transitions. [2025-01-10 06:07:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:07:30,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:30,327 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-01-10 06:07:30,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:07:30,327 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:30,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1902088013, now seen corresponding path program 1 times [2025-01-10 06:07:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:30,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793060917] [2025-01-10 06:07:30,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:30,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:07:30,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:07:30,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:30,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:07:30,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793060917] [2025-01-10 06:07:30,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793060917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093639062] [2025-01-10 06:07:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:30,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:30,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:30,550 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-01-10 06:07:30,554 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-01-10 06:07:30,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:07:31,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:07:31,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:31,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:31,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:07:31,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:07:31,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:07:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093639062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:07:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:07:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902142883] [2025-01-10 06:07:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:07:31,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:31,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:07:31,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:07:31,089 INFO L87 Difference]: Start difference. First operand 459 states and 631 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-01-10 06:07:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:31,173 INFO L93 Difference]: Finished difference Result 762 states and 1074 transitions. [2025-01-10 06:07:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:07:31,174 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-01-10 06:07:31,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:31,179 INFO L225 Difference]: With dead ends: 762 [2025-01-10 06:07:31,179 INFO L226 Difference]: Without dead ends: 761 [2025-01-10 06:07:31,180 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-01-10 06:07:31,181 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 837 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1750 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.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:31,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1750 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-01-10 06:07:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 458. [2025-01-10 06:07:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 398 states have (on average 1.5125628140703518) internal successors, (602), 440 states have internal predecessors, (602), 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-01-10 06:07:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2025-01-10 06:07:31,199 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 50 [2025-01-10 06:07:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:31,200 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2025-01-10 06:07:31,200 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-01-10 06:07:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2025-01-10 06:07:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 06:07:31,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:31,202 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-01-10 06:07:31,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:07:31,403 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-01-10 06:07:31,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:31,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:31,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1164814072, now seen corresponding path program 1 times [2025-01-10 06:07:31,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:31,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244283223] [2025-01-10 06:07:31,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:31,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:31,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 06:07:31,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 06:07:31,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:31,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:07:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244283223] [2025-01-10 06:07:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244283223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445444091] [2025-01-10 06:07:31,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:31,638 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-01-10 06:07:31,647 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-01-10 06:07:31,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 06:07:32,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 06:07:32,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:32,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:32,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:07:32,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:07:32,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:07:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:07:32,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445444091] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:07:32,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:07:32,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:07:32,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53040487] [2025-01-10 06:07:32,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:07:32,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:07:32,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:32,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:07:32,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:07:32,181 INFO L87 Difference]: Start difference. First operand 458 states and 630 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-01-10 06:07:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:32,327 INFO L93 Difference]: Finished difference Result 1667 states and 2400 transitions. [2025-01-10 06:07:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:07:32,328 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-01-10 06:07:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:32,335 INFO L225 Difference]: With dead ends: 1667 [2025-01-10 06:07:32,335 INFO L226 Difference]: Without dead ends: 1666 [2025-01-10 06:07:32,336 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-01-10 06:07:32,338 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 2090 mSDsluCounter, 3668 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 4247 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:32,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 4247 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2025-01-10 06:07:32,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 470. [2025-01-10 06:07:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 410 states have (on average 1.5048780487804878) internal successors, (617), 452 states have internal predecessors, (617), 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-01-10 06:07:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 645 transitions. [2025-01-10 06:07:32,357 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 645 transitions. Word has length 51 [2025-01-10 06:07:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:32,357 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 645 transitions. [2025-01-10 06:07:32,358 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-01-10 06:07:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 645 transitions. [2025-01-10 06:07:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:07:32,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:32,358 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-01-10 06:07:32,368 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-01-10 06:07:32,558 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-01-10 06:07:32,559 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:32,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1166411860, now seen corresponding path program 1 times [2025-01-10 06:07:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056711468] [2025-01-10 06:07:32,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:32,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:07:32,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:07:32,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:32,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:07:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056711468] [2025-01-10 06:07:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056711468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020244674] [2025-01-10 06:07:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:32,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:32,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:32,776 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-01-10 06:07:32,781 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-01-10 06:07:33,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:07:33,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:07:33,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:33,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:07:33,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:07:33,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:07:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:07:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020244674] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:07:33,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:07:33,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:07:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035117099] [2025-01-10 06:07:33,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:07:33,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:07:33,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:33,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:07:33,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:07:33,378 INFO L87 Difference]: Start difference. First operand 470 states and 645 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-01-10 06:07:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:33,421 INFO L93 Difference]: Finished difference Result 915 states and 1267 transitions. [2025-01-10 06:07:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:07:33,421 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-01-10 06:07:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:33,423 INFO L225 Difference]: With dead ends: 915 [2025-01-10 06:07:33,423 INFO L226 Difference]: Without dead ends: 488 [2025-01-10 06:07:33,424 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-01-10 06:07:33,424 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 4 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:33,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1165 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-01-10 06:07:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-01-10 06:07:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 428 states have (on average 1.483644859813084) internal successors, (635), 470 states have internal predecessors, (635), 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-01-10 06:07:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 663 transitions. [2025-01-10 06:07:33,461 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 663 transitions. Word has length 55 [2025-01-10 06:07:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:33,461 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 663 transitions. [2025-01-10 06:07:33,461 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-01-10 06:07:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 663 transitions. [2025-01-10 06:07:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 06:07:33,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:33,462 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-01-10 06:07:33,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:07:33,668 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-01-10 06:07:33,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:33,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:33,668 INFO L85 PathProgramCache]: Analyzing trace with hash -824045146, now seen corresponding path program 1 times [2025-01-10 06:07:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:33,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893468261] [2025-01-10 06:07:33,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:33,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:33,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 06:07:33,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 06:07:33,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:33,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:07:33,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:33,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893468261] [2025-01-10 06:07:33,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893468261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:33,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:33,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841159972] [2025-01-10 06:07:33,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:33,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:33,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:33,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:33,964 INFO L87 Difference]: Start difference. First operand 488 states and 663 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-01-10 06:07:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:34,064 INFO L93 Difference]: Finished difference Result 973 states and 1354 transitions. [2025-01-10 06:07:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:34,064 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-01-10 06:07:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:34,066 INFO L225 Difference]: With dead ends: 973 [2025-01-10 06:07:34,066 INFO L226 Difference]: Without dead ends: 585 [2025-01-10 06:07:34,068 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-01-10 06:07:34,068 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 120 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:34,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1138 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-01-10 06:07:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 531. [2025-01-10 06:07:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 470 states have (on average 1.4723404255319148) internal successors, (692), 512 states have internal predecessors, (692), 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-01-10 06:07:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 722 transitions. [2025-01-10 06:07:34,085 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 722 transitions. Word has length 60 [2025-01-10 06:07:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:34,085 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 722 transitions. [2025-01-10 06:07:34,085 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-01-10 06:07:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 722 transitions. [2025-01-10 06:07:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 06:07:34,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:34,086 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-01-10 06:07:34,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:07:34,086 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:34,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1633390836, now seen corresponding path program 1 times [2025-01-10 06:07:34,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715309332] [2025-01-10 06:07:34,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:34,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 06:07:34,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 06:07:34,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:34,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:07:34,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:34,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715309332] [2025-01-10 06:07:34,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715309332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:34,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:34,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566713096] [2025-01-10 06:07:34,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:34,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:34,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:34,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:34,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:34,265 INFO L87 Difference]: Start difference. First operand 531 states and 722 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-01-10 06:07:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:34,288 INFO L93 Difference]: Finished difference Result 533 states and 722 transitions. [2025-01-10 06:07:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:34,289 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-01-10 06:07:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:34,291 INFO L225 Difference]: With dead ends: 533 [2025-01-10 06:07:34,291 INFO L226 Difference]: Without dead ends: 531 [2025-01-10 06:07:34,291 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-01-10 06:07:34,292 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 1 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:34,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1164 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-01-10 06:07:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-01-10 06:07:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 470 states have (on average 1.4680851063829787) internal successors, (690), 512 states have internal predecessors, (690), 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-01-10 06:07:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 720 transitions. [2025-01-10 06:07:34,309 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 720 transitions. Word has length 62 [2025-01-10 06:07:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:34,309 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 720 transitions. [2025-01-10 06:07:34,309 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-01-10 06:07:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 720 transitions. [2025-01-10 06:07:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 06:07:34,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:34,310 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-01-10 06:07:34,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:07:34,311 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:34,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -971419385, now seen corresponding path program 2 times [2025-01-10 06:07:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:34,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981321932] [2025-01-10 06:07:34,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:07:34,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:34,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-10 06:07:34,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-01-10 06:07:34,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:07:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-10 06:07:34,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:34,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981321932] [2025-01-10 06:07:34,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981321932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:34,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:07:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082245637] [2025-01-10 06:07:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:34,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:07:34,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:34,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:07:34,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:07:34,654 INFO L87 Difference]: Start difference. First operand 531 states and 720 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-01-10 06:07:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:34,763 INFO L93 Difference]: Finished difference Result 990 states and 1362 transitions. [2025-01-10 06:07:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:07:34,764 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-01-10 06:07:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:34,766 INFO L225 Difference]: With dead ends: 990 [2025-01-10 06:07:34,766 INFO L226 Difference]: Without dead ends: 531 [2025-01-10 06:07:34,767 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-01-10 06:07:34,767 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 531 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:34,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 2309 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-01-10 06:07:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-01-10 06:07:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 470 states have (on average 1.4659574468085106) internal successors, (689), 512 states have internal predecessors, (689), 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-01-10 06:07:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 719 transitions. [2025-01-10 06:07:34,784 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 719 transitions. Word has length 63 [2025-01-10 06:07:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:34,784 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 719 transitions. [2025-01-10 06:07:34,784 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-01-10 06:07:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 719 transitions. [2025-01-10 06:07:34,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 06:07:34,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:34,785 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-01-10 06:07:34,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:07:34,786 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:34,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1105628172, now seen corresponding path program 2 times [2025-01-10 06:07:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214347104] [2025-01-10 06:07:34,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:07:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:34,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 06:07:34,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:07:34,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:07:34,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-10 06:07:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214347104] [2025-01-10 06:07:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214347104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100648680] [2025-01-10 06:07:35,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:07:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:35,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:35,113 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-01-10 06:07:35,123 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-01-10 06:07:35,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 06:07:39,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:07:39,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:07:39,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:39,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:07:39,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 06:07:39,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:07:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 06:07:39,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100648680] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:07:39,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:07:39,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:07:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943213616] [2025-01-10 06:07:39,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:07:39,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:07:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:39,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:07:39,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:07:39,238 INFO L87 Difference]: Start difference. First operand 531 states and 719 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-01-10 06:07:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:39,531 INFO L93 Difference]: Finished difference Result 1045 states and 1431 transitions. [2025-01-10 06:07:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 06:07:39,532 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-01-10 06:07:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:39,534 INFO L225 Difference]: With dead ends: 1045 [2025-01-10 06:07:39,534 INFO L226 Difference]: Without dead ends: 566 [2025-01-10 06:07:39,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 06:07:39,536 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 9 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2883 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:39,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2883 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-10 06:07:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-10 06:07:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 506 states have (on average 1.4308300395256917) internal successors, (724), 547 states have internal predecessors, (724), 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-01-10 06:07:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 754 transitions. [2025-01-10 06:07:39,551 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 754 transitions. Word has length 73 [2025-01-10 06:07:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:39,551 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 754 transitions. [2025-01-10 06:07:39,551 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-01-10 06:07:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 754 transitions. [2025-01-10 06:07:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 06:07:39,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:39,552 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-01-10 06:07:39,570 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-01-10 06:07:39,753 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-01-10 06:07:39,753 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:39,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2079806245, now seen corresponding path program 1 times [2025-01-10 06:07:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305899996] [2025-01-10 06:07:39,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:39,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:07:39,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:07:39,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:39,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305899996] [2025-01-10 06:07:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305899996] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271384666] [2025-01-10 06:07:40,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:40,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:40,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:40,134 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-01-10 06:07:40,137 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-01-10 06:07:40,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:07:40,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:07:40,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:40,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:40,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1804 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:07:40,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:40,809 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:40,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:07:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271384666] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:07:40,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:07:40,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 06:07:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102208431] [2025-01-10 06:07:40,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:07:40,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:07:40,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:40,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:07:40,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:07:40,874 INFO L87 Difference]: Start difference. First operand 566 states and 754 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-01-10 06:07:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:41,174 INFO L93 Difference]: Finished difference Result 4011 states and 5740 transitions. [2025-01-10 06:07:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:07:41,174 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-01-10 06:07:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:41,186 INFO L225 Difference]: With dead ends: 4011 [2025-01-10 06:07:41,186 INFO L226 Difference]: Without dead ends: 4010 [2025-01-10 06:07:41,187 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-01-10 06:07:41,188 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 6678 mSDsluCounter, 6494 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6748 SdHoareTripleChecker+Valid, 7072 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:41,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6748 Valid, 7072 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2025-01-10 06:07:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 590. [2025-01-10 06:07:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 530 states have (on average 1.4226415094339622) internal successors, (754), 571 states have internal predecessors, (754), 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-01-10 06:07:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 784 transitions. [2025-01-10 06:07:41,227 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 784 transitions. Word has length 97 [2025-01-10 06:07:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:41,228 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 784 transitions. [2025-01-10 06:07:41,228 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-01-10 06:07:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 784 transitions. [2025-01-10 06:07:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:07:41,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:41,229 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:07:41,240 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-01-10 06:07:41,429 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-01-10 06:07:41,430 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:41,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:41,430 INFO L85 PathProgramCache]: Analyzing trace with hash 161794290, now seen corresponding path program 1 times [2025-01-10 06:07:41,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:41,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392477309] [2025-01-10 06:07:41,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:41,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:07:41,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:07:41,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:41,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:41,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392477309] [2025-01-10 06:07:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392477309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:41,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133726378] [2025-01-10 06:07:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:41,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:41,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:41,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:41,639 INFO L87 Difference]: Start difference. First operand 590 states and 784 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:07:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:41,720 INFO L93 Difference]: Finished difference Result 974 states and 1344 transitions. [2025-01-10 06:07:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-10 06:07:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:41,723 INFO L225 Difference]: With dead ends: 974 [2025-01-10 06:07:41,723 INFO L226 Difference]: Without dead ends: 643 [2025-01-10 06:07:41,723 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-01-10 06:07:41,725 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 75 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:41,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1171 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:41,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-01-10 06:07:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 593. [2025-01-10 06:07:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 535 states have (on average 1.416822429906542) internal successors, (758), 574 states have internal predecessors, (758), 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-01-10 06:07:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 788 transitions. [2025-01-10 06:07:41,743 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 788 transitions. Word has length 102 [2025-01-10 06:07:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:41,744 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 788 transitions. [2025-01-10 06:07:41,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:07:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 788 transitions. [2025-01-10 06:07:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:07:41,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:41,745 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:07:41,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:07:41,745 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:41,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash 162428767, now seen corresponding path program 1 times [2025-01-10 06:07:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113473363] [2025-01-10 06:07:41,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:41,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:07:41,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:07:41,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:41,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:42,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:42,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113473363] [2025-01-10 06:07:42,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113473363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:42,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:42,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:42,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467750021] [2025-01-10 06:07:42,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:42,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:42,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:42,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:42,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:42,056 INFO L87 Difference]: Start difference. First operand 593 states and 788 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:07:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:42,166 INFO L93 Difference]: Finished difference Result 647 states and 867 transitions. [2025-01-10 06:07:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:42,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-10 06:07:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:42,169 INFO L225 Difference]: With dead ends: 647 [2025-01-10 06:07:42,169 INFO L226 Difference]: Without dead ends: 644 [2025-01-10 06:07:42,169 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-01-10 06:07:42,169 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 193 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:42,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 954 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-01-10 06:07:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 590. [2025-01-10 06:07:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 535 states have (on average 1.411214953271028) internal successors, (755), 571 states have internal predecessors, (755), 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-01-10 06:07:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 785 transitions. [2025-01-10 06:07:42,186 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 785 transitions. Word has length 102 [2025-01-10 06:07:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:42,186 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 785 transitions. [2025-01-10 06:07:42,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:07:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 785 transitions. [2025-01-10 06:07:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:07:42,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:42,187 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-01-10 06:07:42,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:07:42,187 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:42,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash 720656257, now seen corresponding path program 1 times [2025-01-10 06:07:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515806980] [2025-01-10 06:07:42,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:42,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:07:42,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:07:42,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:42,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:42,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:42,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515806980] [2025-01-10 06:07:42,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515806980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:42,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:42,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:42,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084435793] [2025-01-10 06:07:42,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:42,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:42,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:42,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:42,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:42,386 INFO L87 Difference]: Start difference. First operand 590 states and 785 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-01-10 06:07:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:42,466 INFO L93 Difference]: Finished difference Result 976 states and 1346 transitions. [2025-01-10 06:07:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:42,466 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-01-10 06:07:42,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:42,468 INFO L225 Difference]: With dead ends: 976 [2025-01-10 06:07:42,468 INFO L226 Difference]: Without dead ends: 641 [2025-01-10 06:07:42,469 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-01-10 06:07:42,471 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 158 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:42,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1033 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-01-10 06:07:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 575. [2025-01-10 06:07:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 524 states have (on average 1.4026717557251909) internal successors, (735), 556 states have internal predecessors, (735), 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-01-10 06:07:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 765 transitions. [2025-01-10 06:07:42,489 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 765 transitions. Word has length 103 [2025-01-10 06:07:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:42,490 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 765 transitions. [2025-01-10 06:07:42,490 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-01-10 06:07:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 765 transitions. [2025-01-10 06:07:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:07:42,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:42,491 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-01-10 06:07:42,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:07:42,491 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:42,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash 740325106, now seen corresponding path program 1 times [2025-01-10 06:07:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058220814] [2025-01-10 06:07:42,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:42,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:07:42,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:07:42,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:42,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:42,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058220814] [2025-01-10 06:07:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058220814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:42,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143993213] [2025-01-10 06:07:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:42,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:42,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:42,776 INFO L87 Difference]: Start difference. First operand 575 states and 765 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-01-10 06:07:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:42,867 INFO L93 Difference]: Finished difference Result 629 states and 844 transitions. [2025-01-10 06:07:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:42,867 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-01-10 06:07:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:42,869 INFO L225 Difference]: With dead ends: 629 [2025-01-10 06:07:42,869 INFO L226 Difference]: Without dead ends: 628 [2025-01-10 06:07:42,870 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-01-10 06:07:42,870 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 190 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:42,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1009 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-01-10 06:07:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 574. [2025-01-10 06:07:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 524 states have (on average 1.400763358778626) internal successors, (734), 555 states have internal predecessors, (734), 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-01-10 06:07:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 764 transitions. [2025-01-10 06:07:42,895 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 764 transitions. Word has length 103 [2025-01-10 06:07:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:42,895 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 764 transitions. [2025-01-10 06:07:42,895 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-01-10 06:07:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 764 transitions. [2025-01-10 06:07:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 06:07:42,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:42,896 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-01-10 06:07:42,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:07:42,896 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:42,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1967573616, now seen corresponding path program 1 times [2025-01-10 06:07:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029501616] [2025-01-10 06:07:42,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:43,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:07:43,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:07:43,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:43,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029501616] [2025-01-10 06:07:43,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029501616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531103872] [2025-01-10 06:07:43,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:43,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:43,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:43,240 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-01-10 06:07:43,241 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-01-10 06:07:43,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:07:43,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:07:43,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:43,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:43,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:07:43,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:07:43,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:07:43,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531103872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:43,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:07:43,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:07:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773957990] [2025-01-10 06:07:43,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:43,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:07:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:43,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:07:43,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:07:43,979 INFO L87 Difference]: Start difference. First operand 574 states and 764 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-01-10 06:07:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:44,105 INFO L93 Difference]: Finished difference Result 1077 states and 1483 transitions. [2025-01-10 06:07:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:07:44,106 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-01-10 06:07:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:44,108 INFO L225 Difference]: With dead ends: 1077 [2025-01-10 06:07:44,108 INFO L226 Difference]: Without dead ends: 691 [2025-01-10 06:07:44,109 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-01-10 06:07:44,110 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 359 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:44,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1360 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-01-10 06:07:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 573. [2025-01-10 06:07:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 525 states have (on average 1.3923809523809523) internal successors, (731), 554 states have internal predecessors, (731), 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-01-10 06:07:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 761 transitions. [2025-01-10 06:07:44,127 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 761 transitions. Word has length 105 [2025-01-10 06:07:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:44,127 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 761 transitions. [2025-01-10 06:07:44,127 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-01-10 06:07:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 761 transitions. [2025-01-10 06:07:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-10 06:07:44,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:44,128 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-01-10 06:07:44,143 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-01-10 06:07:44,332 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-01-10 06:07:44,332 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:44,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1727687156, now seen corresponding path program 1 times [2025-01-10 06:07:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:44,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319732063] [2025-01-10 06:07:44,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:44,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-10 06:07:44,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-10 06:07:44,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:44,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-10 06:07:44,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:44,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319732063] [2025-01-10 06:07:44,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319732063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:44,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:44,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:07:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013065516] [2025-01-10 06:07:44,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:44,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:07:44,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:44,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:07:44,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:07:44,574 INFO L87 Difference]: Start difference. First operand 573 states and 761 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-01-10 06:07:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:44,596 INFO L93 Difference]: Finished difference Result 573 states and 761 transitions. [2025-01-10 06:07:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:07:44,597 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-01-10 06:07:44,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:44,599 INFO L225 Difference]: With dead ends: 573 [2025-01-10 06:07:44,599 INFO L226 Difference]: Without dead ends: 572 [2025-01-10 06:07:44,599 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-01-10 06:07:44,599 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:44,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1138 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-01-10 06:07:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-01-10 06:07:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 525 states have (on average 1.3904761904761904) internal successors, (730), 553 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-01-10 06:07:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 760 transitions. [2025-01-10 06:07:44,616 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 760 transitions. Word has length 108 [2025-01-10 06:07:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 760 transitions. [2025-01-10 06:07:44,616 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-01-10 06:07:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 760 transitions. [2025-01-10 06:07:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 06:07:44,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:44,617 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-01-10 06:07:44,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 06:07:44,617 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:44,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2018693901, now seen corresponding path program 1 times [2025-01-10 06:07:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:44,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116554066] [2025-01-10 06:07:44,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:44,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 06:07:44,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:07:44,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:44,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:07:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116554066] [2025-01-10 06:07:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116554066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:07:45,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:07:45,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:07:45,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310737247] [2025-01-10 06:07:45,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:07:45,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:07:45,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:45,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:07:45,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:07:45,104 INFO L87 Difference]: Start difference. First operand 572 states and 760 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-01-10 06:07:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:45,136 INFO L93 Difference]: Finished difference Result 993 states and 1356 transitions. [2025-01-10 06:07:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:07:45,137 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-01-10 06:07:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:45,142 INFO L225 Difference]: With dead ends: 993 [2025-01-10 06:07:45,142 INFO L226 Difference]: Without dead ends: 575 [2025-01-10 06:07:45,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:07:45,143 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:45,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1703 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-01-10 06:07:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2025-01-10 06:07:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 527 states have (on average 1.3908918406072106) internal successors, (733), 556 states have internal predecessors, (733), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (16), 13 states have call predecessors, (16), 13 states have call successors, (16) [2025-01-10 06:07:45,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 766 transitions. [2025-01-10 06:07:45,162 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 766 transitions. Word has length 109 [2025-01-10 06:07:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:45,162 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 766 transitions. [2025-01-10 06:07:45,162 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-01-10 06:07:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 766 transitions. [2025-01-10 06:07:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 06:07:45,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:45,164 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-01-10 06:07:45,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:07:45,164 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:45,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2074006345, now seen corresponding path program 1 times [2025-01-10 06:07:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798966636] [2025-01-10 06:07:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:45,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:07:45,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:07:45,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:45,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:07:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798966636] [2025-01-10 06:07:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798966636] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554987015] [2025-01-10 06:07:45,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:45,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:45,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:45,961 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-01-10 06:07:45,963 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-01-10 06:07:46,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:07:47,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:07:47,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:47,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:47,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1912 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:07:47,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:07:47,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:07:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:07:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554987015] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:07:47,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:07:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:07:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48832313] [2025-01-10 06:07:47,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:07:47,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:07:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:47,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:07:47,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:07:47,766 INFO L87 Difference]: Start difference. First operand 575 states and 766 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-01-10 06:07:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:47,914 INFO L93 Difference]: Finished difference Result 1007 states and 1382 transitions. [2025-01-10 06:07:47,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:07:47,914 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-01-10 06:07:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:47,917 INFO L225 Difference]: With dead ends: 1007 [2025-01-10 06:07:47,917 INFO L226 Difference]: Without dead ends: 586 [2025-01-10 06:07:47,918 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-01-10 06:07:47,918 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 5 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:47,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1715 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:07:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-10 06:07:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 580. [2025-01-10 06:07:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 532 states have (on average 1.394736842105263) internal successors, (742), 560 states have internal predecessors, (742), 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-01-10 06:07:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 773 transitions. [2025-01-10 06:07:47,945 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 773 transitions. Word has length 110 [2025-01-10 06:07:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:47,945 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 773 transitions. [2025-01-10 06:07:47,945 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-01-10 06:07:47,945 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 773 transitions. [2025-01-10 06:07:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 06:07:47,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:47,946 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-01-10 06:07:47,976 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-01-10 06:07:48,147 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-01-10 06:07:48,147 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:48,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1904089849, now seen corresponding path program 1 times [2025-01-10 06:07:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374962281] [2025-01-10 06:07:48,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:48,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:07:48,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:07:48,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:48,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:07:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374962281] [2025-01-10 06:07:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374962281] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408786777] [2025-01-10 06:07:48,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:07:48,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:48,598 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-01-10 06:07:48,599 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-01-10 06:07:49,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:07:49,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:07:49,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:07:49,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:49,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:07:49,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:07:49,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:07:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-10 06:07:49,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408786777] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:07:49,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:07:49,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:07:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842070925] [2025-01-10 06:07:49,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:07:49,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:07:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:07:49,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:07:49,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:07:49,499 INFO L87 Difference]: Start difference. First operand 580 states and 773 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-01-10 06:07:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:07:49,550 INFO L93 Difference]: Finished difference Result 683 states and 884 transitions. [2025-01-10 06:07:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:07:49,550 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-01-10 06:07:49,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:07:49,552 INFO L225 Difference]: With dead ends: 683 [2025-01-10 06:07:49,552 INFO L226 Difference]: Without dead ends: 682 [2025-01-10 06:07:49,553 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-01-10 06:07:49,553 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:07:49,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:07:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-01-10 06:07:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-01-10 06:07:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 634 states have (on average 1.3406940063091484) internal successors, (850), 662 states have internal predecessors, (850), 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-01-10 06:07:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 881 transitions. [2025-01-10 06:07:49,576 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 881 transitions. Word has length 110 [2025-01-10 06:07:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:07:49,576 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 881 transitions. [2025-01-10 06:07:49,576 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-01-10 06:07:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 881 transitions. [2025-01-10 06:07:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-10 06:07:49,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:07:49,578 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-01-10 06:07:49,591 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-01-10 06:07:49,782 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-01-10 06:07:49,782 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_error_msg_and_dieErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_error_msg_and_dieErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_error_msg_and_dieErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-01-10 06:07:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:07:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash -904981901, now seen corresponding path program 2 times [2025-01-10 06:07:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:07:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383023493] [2025-01-10 06:07:49,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:07:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:07:49,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-01-10 06:07:50,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 06:07:50,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:07:50,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-01-10 06:07:50,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:07:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383023493] [2025-01-10 06:07:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383023493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:07:50,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950656568] [2025-01-10 06:07:50,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:07:50,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:07:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:07:50,518 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-01-10 06:07:50,525 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-01-10 06:07:51,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-01-10 06:07:53,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-01-10 06:07:53,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:07:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:07:53,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-01-10 06:07:53,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:07:53,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:53,648 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-01-10 06:07:53,693 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 06:07:53,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-10 06:07:53,725 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:07:53,725 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-01-10 06:07:53,775 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-01-10 06:07:53,822 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-01-10 06:07:53,860 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-01-10 06:07:53,910 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-01-10 06:07:53,940 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-01-10 06:07:53,961 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-01-10 06:07:53,986 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-01-10 06:07:54,039 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-01-10 06:07:54,063 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-01-10 06:07:54,081 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-01-10 06:07:54,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:54,104 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-01-10 06:07:54,147 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 06:07:54,147 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-01-10 06:07:54,202 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-01-10 06:07:54,203 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-01-10 06:07:54,216 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 16 treesize of output 11 [2025-01-10 06:07:54,264 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-01-10 06:07:54,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:54,281 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-01-10 06:07:54,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:54,301 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-01-10 06:07:54,301 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-01-10 06:07:54,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:54,318 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-01-10 06:07:54,345 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-01-10 06:07:54,345 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-01-10 06:07:54,360 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-01-10 06:07:54,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:54,385 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-01-10 06:07:54,386 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-01-10 06:07:54,391 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-01-10 06:07:54,402 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-01-10 06:07:54,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:54,426 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-01-10 06:07:54,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:54,440 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-01-10 06:07:54,440 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-01-10 06:07:54,450 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-01-10 06:07:54,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:54,466 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-01-10 06:07:54,466 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-01-10 06:07:54,525 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,525 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-01-10 06:07:54,533 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-01-10 06:07:54,571 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,572 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-01-10 06:07:54,580 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-01-10 06:07:54,622 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,622 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-01-10 06:07:54,631 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-01-10 06:07:54,682 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,682 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-01-10 06:07:54,687 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-01-10 06:07:54,733 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,733 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-01-10 06:07:54,742 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-01-10 06:07:54,781 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,781 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-01-10 06:07:54,787 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-01-10 06:07:54,819 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,819 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-01-10 06:07:54,825 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-01-10 06:07:54,865 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,866 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-01-10 06:07:54,877 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-01-10 06:07:54,916 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:07:54,916 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-01-10 06:07:54,921 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-01-10 06:07:54,972 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-01-10 06:07:54,974 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-01-10 06:07:55,121 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-01-10 06:07:55,137 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-01-10 06:07:55,158 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-01-10 06:07:55,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:55,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:55,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:55,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:55,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:55,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:07:55,213 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-10 06:07:55,213 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-01-10 06:07:55,785 INFO L349 Elim1Store]: treesize reduction 72, result has 74.7 percent of original size [2025-01-10 06:07:55,786 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-01-10 06:08:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 241 trivial. 9 not checked. [2025-01-10 06:08:01,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:08:30,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9150 (Array Int Int))) (not (= 33 (select (select (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store |c_#memory_int| .cse0 v_ArrVal_9148) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_9150))) 11) 0)))) is different from false [2025-01-10 06:08:30,681 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9146 (Array Int Int)) (v_ArrVal_9147 (Array Int Int)) (v_ArrVal_9150 (Array Int Int)) (v_ArrVal_9144 (Array Int Int)) (v_ArrVal_9145 (Array Int Int))) (not (= 33 (select (select (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9144))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9147))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9145) .cse1 v_ArrVal_9146) .cse2 v_ArrVal_9148) (select (select (store .cse3 .cse2 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_9150))))))) 11) 0)))) is different from false [2025-01-10 06:08:30,961 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9146 (Array Int Int)) (v_ArrVal_9147 (Array Int Int)) (v_ArrVal_9140 (Array Int Int)) (v_ArrVal_9141 (Array Int Int)) (v_ArrVal_9150 (Array Int Int)) (v_ArrVal_9144 (Array Int Int)) (v_ArrVal_9145 (Array Int Int)) (v_ArrVal_9142 (Array Int Int)) (v_ArrVal_9143 (Array Int Int))) (not (= 33 (select (select (let ((.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9141))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_9142))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_9144))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_9147))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9140) .cse1 v_ArrVal_9143) .cse2 v_ArrVal_9145) .cse3 v_ArrVal_9146) .cse4 v_ArrVal_9148) (select (select (store .cse5 .cse4 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_9150))))))))))) 11) 0)))) is different from false [2025-01-10 06:08:32,180 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9140 (Array Int Int)) (v_ArrVal_9141 (Array Int Int)) (v_ArrVal_9150 (Array Int Int)) (v_ArrVal_9144 (Array Int Int)) (v_ArrVal_9145 (Array Int Int)) (v_ArrVal_9142 (Array Int Int)) (v_ArrVal_9143 (Array Int Int)) (v_ArrVal_9137 (Array Int Int)) (v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9138 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9146 (Array Int Int)) (v_ArrVal_9136 (Array Int Int)) (v_ArrVal_9147 (Array Int Int)) (v_ArrVal_9139 (Array Int Int))) (not (= 33 (select (select (let ((.cse8 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9137))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_9138))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_9141))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_9142))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_9144))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_9147))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9136) .cse1 v_ArrVal_9139) .cse2 v_ArrVal_9140) .cse3 v_ArrVal_9143) .cse4 v_ArrVal_9145) .cse5 v_ArrVal_9146) .cse6 v_ArrVal_9148) (select (select (store .cse7 .cse6 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_9150))))))))))))))) 11) 0)))) is different from false [2025-01-10 06:08:32,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9140 (Array Int Int)) (v_ArrVal_9141 (Array Int Int)) (v_ArrVal_9150 (Array Int Int)) (v_ArrVal_9144 (Array Int Int)) (v_ArrVal_9134 (Array Int Int)) (v_ArrVal_9145 (Array Int Int)) (v_ArrVal_9142 (Array Int Int)) (v_ArrVal_9143 (Array Int Int)) (v_ArrVal_9137 (Array Int Int)) (v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9138 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9135 (Array Int Int)) (v_ArrVal_9146 (Array Int Int)) (v_ArrVal_9136 (Array Int Int)) (v_ArrVal_9147 (Array Int Int)) (v_ArrVal_9139 (Array Int Int))) (not (= 33 (select (select (let ((.cse9 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9135))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_9137))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_9138))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_9141))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_9142))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_9144))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse8 (store .cse10 .cse6 v_ArrVal_9147))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9134) .cse1 v_ArrVal_9136) .cse2 v_ArrVal_9139) .cse3 v_ArrVal_9140) .cse4 v_ArrVal_9143) .cse5 v_ArrVal_9145) .cse6 v_ArrVal_9146) .cse7 v_ArrVal_9148) (select (select (store .cse8 .cse7 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_9150))))))))))))))))) 11) 0)))) is different from false [2025-01-10 06:08:35,820 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9140 (Array Int Int)) (v_ArrVal_9141 (Array Int Int)) (v_ArrVal_9150 (Array Int Int)) (v_ArrVal_9133 (Array Int Int)) (v_ArrVal_9144 (Array Int Int)) (v_ArrVal_9134 (Array Int Int)) (v_ArrVal_9145 (Array Int Int)) (v_ArrVal_9142 (Array Int Int)) (v_ArrVal_9132 (Array Int Int)) (v_ArrVal_9143 (Array Int Int)) (v_ArrVal_9137 (Array Int Int)) (v_ArrVal_9148 (Array Int Int)) (v_ArrVal_9138 (Array Int Int)) (v_ArrVal_9149 (Array Int Int)) (v_ArrVal_9135 (Array Int Int)) (v_ArrVal_9146 (Array Int Int)) (v_ArrVal_9136 (Array Int Int)) (v_ArrVal_9147 (Array Int Int)) (v_ArrVal_9139 (Array Int Int))) (not (= (select (select (let ((.cse10 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9132))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_9135))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_9137))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_9138))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_9141))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_9142))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_9144))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_9147))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (store (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_9133) .cse1 v_ArrVal_9134) .cse2 v_ArrVal_9136) .cse3 v_ArrVal_9139) .cse4 v_ArrVal_9140) .cse5 v_ArrVal_9143) .cse6 v_ArrVal_9145) .cse7 v_ArrVal_9146) .cse8 v_ArrVal_9148) (select (select (store .cse9 .cse8 v_ArrVal_9149) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_9150))))))))))))))))))) 11) 0) 33))) is different from false [2025-01-10 06:08:35,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:08:35,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53236 treesize of output 28685