./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:14:47,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:14:47,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:14:47,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:14:47,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:14:47,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:14:47,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:14:47,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:14:47,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:14:47,244 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:14:47,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:14:47,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:14:47,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:14:47,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:14:47,245 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:14:47,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:14:47,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:14:47,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:14:47,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:14:47,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:14:47,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:14:47,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:14:47,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:14:47,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:14:47,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:14:47,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:14:47,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:14:47,248 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-02-06 18:14:47,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:14:47,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:14:47,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:14:47,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:14:47,457 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:14:47,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-02-06 18:14:48,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66c050f21/acfd2772f7e6444b8d8421ad6a92c4e8/FLAG10d86e53f [2025-02-06 18:14:48,946 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:14:48,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-02-06 18:14:48,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66c050f21/acfd2772f7e6444b8d8421ad6a92c4e8/FLAG10d86e53f [2025-02-06 18:14:49,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66c050f21/acfd2772f7e6444b8d8421ad6a92c4e8 [2025-02-06 18:14:49,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:14:49,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:14:49,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:14:49,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:14:49,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:14:49,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52037b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49, skipping insertion in model container [2025-02-06 18:14:49,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:14:49,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:14:49,550 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:14:49,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:14:49,652 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:14:49,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49 WrapperNode [2025-02-06 18:14:49,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:14:49,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:14:49,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:14:49,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:14:49,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,721 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1247 [2025-02-06 18:14:49,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:14:49,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:14:49,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:14:49,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:14:49,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,780 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-02-06 18:14:49,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:14:49,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:14:49,822 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:14:49,822 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:14:49,823 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (1/1) ... [2025-02-06 18:14:49,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:14:49,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:14:49,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:14:49,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:14:49,859 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:14:49,859 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:14:49,859 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:14:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:14:49,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:14:50,005 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:14:50,007 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:14:50,954 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 18:14:51,013 INFO L? ?]: Removed 303 outVars from TransFormulas that were not future-live. [2025-02-06 18:14:51,014 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:14:51,044 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:14:51,047 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 18:14:51,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:14:51 BoogieIcfgContainer [2025-02-06 18:14:51,047 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:14:51,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:14:51,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:14:51,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:14:51,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:14:49" (1/3) ... [2025-02-06 18:14:51,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ed42d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:14:51, skipping insertion in model container [2025-02-06 18:14:51,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:14:49" (2/3) ... [2025-02-06 18:14:51,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ed42d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:14:51, skipping insertion in model container [2025-02-06 18:14:51,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:14:51" (3/3) ... [2025-02-06 18:14:51,055 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2025-02-06 18:14:51,066 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:14:51,067 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test2-1.i that has 4 procedures, 382 locations, 1 initial locations, 33 loop locations, and 6 error locations. [2025-02-06 18:14:51,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:14:51,121 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;@2fd10dd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:14:51,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:14:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 363 states have (on average 1.6198347107438016) internal successors, (588), 369 states have internal predecessors, (588), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:14:51,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:51,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:51,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:51,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash 206859316, now seen corresponding path program 1 times [2025-02-06 18:14:51,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:51,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795705253] [2025-02-06 18:14:51,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:51,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:14:51,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:14:51,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:51,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:51,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795705253] [2025-02-06 18:14:51,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795705253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:51,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:51,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:14:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668098513] [2025-02-06 18:14:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:51,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:14:51,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:51,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:14:51,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:14:51,269 INFO L87 Difference]: Start difference. First operand has 374 states, 363 states have (on average 1.6198347107438016) internal successors, (588), 369 states have internal predecessors, (588), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:51,373 INFO L93 Difference]: Finished difference Result 744 states and 1183 transitions. [2025-02-06 18:14:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:14:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 18:14:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:51,383 INFO L225 Difference]: With dead ends: 744 [2025-02-06 18:14:51,384 INFO L226 Difference]: Without dead ends: 368 [2025-02-06 18:14:51,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:14:51,390 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:51,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-06 18:14:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-02-06 18:14:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 358 states have (on average 1.4664804469273742) internal successors, (525), 363 states have internal predecessors, (525), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 531 transitions. [2025-02-06 18:14:51,431 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 531 transitions. Word has length 8 [2025-02-06 18:14:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:51,432 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 531 transitions. [2025-02-06 18:14:51,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 531 transitions. [2025-02-06 18:14:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:14:51,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:51,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:51,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:14:51,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:51,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash 206860277, now seen corresponding path program 1 times [2025-02-06 18:14:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:51,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72029082] [2025-02-06 18:14:51,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:51,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:51,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:14:51,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:14:51,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:51,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 18:14:51,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869232115] [2025-02-06 18:14:51,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:51,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:14:51,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:14:51,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:14:51,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:14:51,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:14:51,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:14:51,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:51,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:51,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 18:14:51,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:14:51,604 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:14:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:51,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:14:51,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:51,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72029082] [2025-02-06 18:14:51,635 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 18:14:51,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869232115] [2025-02-06 18:14:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869232115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:51,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:51,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:14:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104896717] [2025-02-06 18:14:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:51,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:14:51,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:51,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:14:51,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:14:51,638 INFO L87 Difference]: Start difference. First operand 368 states and 531 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:51,866 INFO L93 Difference]: Finished difference Result 729 states and 1055 transitions. [2025-02-06 18:14:51,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:14:51,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 18:14:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:51,873 INFO L225 Difference]: With dead ends: 729 [2025-02-06 18:14:51,873 INFO L226 Difference]: Without dead ends: 727 [2025-02-06 18:14:51,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:14:51,873 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 511 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:51,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1395 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:14:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-06 18:14:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 374. [2025-02-06 18:14:51,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 364 states have (on average 1.4615384615384615) internal successors, (532), 369 states have internal predecessors, (532), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 538 transitions. [2025-02-06 18:14:51,900 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 538 transitions. Word has length 8 [2025-02-06 18:14:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:51,900 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 538 transitions. [2025-02-06 18:14:51,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 538 transitions. [2025-02-06 18:14:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 18:14:51,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:51,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:51,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:14:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:14:52,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2088669308, now seen corresponding path program 1 times [2025-02-06 18:14:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515001412] [2025-02-06 18:14:52,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:14:52,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:14:52,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:52,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:52,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515001412] [2025-02-06 18:14:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515001412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:52,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:14:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494216750] [2025-02-06 18:14:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:52,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:14:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:52,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:14:52,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:14:52,347 INFO L87 Difference]: Start difference. First operand 374 states and 538 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:52,462 INFO L93 Difference]: Finished difference Result 491 states and 706 transitions. [2025-02-06 18:14:52,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:14:52,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-02-06 18:14:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:52,463 INFO L225 Difference]: With dead ends: 491 [2025-02-06 18:14:52,463 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 18:14:52,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:14:52,464 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 36 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:52,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1171 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 18:14:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-06 18:14:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 322 states have (on average 1.4130434782608696) internal successors, (455), 327 states have internal predecessors, (455), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 461 transitions. [2025-02-06 18:14:52,479 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 461 transitions. Word has length 66 [2025-02-06 18:14:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:52,479 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 461 transitions. [2025-02-06 18:14:52,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 461 transitions. [2025-02-06 18:14:52,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 18:14:52,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:52,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:52,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:14:52,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:52,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1922787910, now seen corresponding path program 1 times [2025-02-06 18:14:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:52,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496621555] [2025-02-06 18:14:52,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:52,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:14:52,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:14:52,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:52,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:52,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:52,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496621555] [2025-02-06 18:14:52,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496621555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:52,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:52,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:14:52,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73693693] [2025-02-06 18:14:52,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:52,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:14:52,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:52,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:14:52,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:14:52,589 INFO L87 Difference]: Start difference. First operand 332 states and 461 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:52,688 INFO L93 Difference]: Finished difference Result 443 states and 612 transitions. [2025-02-06 18:14:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:14:52,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-02-06 18:14:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:52,690 INFO L225 Difference]: With dead ends: 443 [2025-02-06 18:14:52,690 INFO L226 Difference]: Without dead ends: 326 [2025-02-06 18:14:52,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:14:52,692 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 9 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:52,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1172 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-06 18:14:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-02-06 18:14:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 316 states have (on average 1.4082278481012658) internal successors, (445), 321 states have internal predecessors, (445), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 451 transitions. [2025-02-06 18:14:52,704 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 451 transitions. Word has length 66 [2025-02-06 18:14:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:52,704 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 451 transitions. [2025-02-06 18:14:52,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 451 transitions. [2025-02-06 18:14:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 18:14:52,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:52,705 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:52,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:14:52,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:52,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash 596970430, now seen corresponding path program 1 times [2025-02-06 18:14:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593931892] [2025-02-06 18:14:52,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:52,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:52,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:14:52,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:14:52,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:52,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:52,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593931892] [2025-02-06 18:14:52,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593931892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:52,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:52,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:14:52,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498164937] [2025-02-06 18:14:52,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:52,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:14:52,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:52,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:14:52,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:14:52,888 INFO L87 Difference]: Start difference. First operand 326 states and 451 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:53,029 INFO L93 Difference]: Finished difference Result 631 states and 879 transitions. [2025-02-06 18:14:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:14:53,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-02-06 18:14:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:53,031 INFO L225 Difference]: With dead ends: 631 [2025-02-06 18:14:53,031 INFO L226 Difference]: Without dead ends: 629 [2025-02-06 18:14:53,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:14:53,032 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 367 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:53,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1187 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-02-06 18:14:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 435. [2025-02-06 18:14:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 425 states have (on average 1.388235294117647) internal successors, (590), 430 states have internal predecessors, (590), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 596 transitions. [2025-02-06 18:14:53,044 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 596 transitions. Word has length 66 [2025-02-06 18:14:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:53,044 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 596 transitions. [2025-02-06 18:14:53,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 596 transitions. [2025-02-06 18:14:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:14:53,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:53,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:53,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:14:53,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:53,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2118404848, now seen corresponding path program 1 times [2025-02-06 18:14:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:53,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099883756] [2025-02-06 18:14:53,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:53,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:53,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:14:53,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:14:53,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:53,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:53,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099883756] [2025-02-06 18:14:53,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099883756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:53,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:53,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:14:53,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781022082] [2025-02-06 18:14:53,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:53,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:14:53,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:53,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:14:53,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:14:53,204 INFO L87 Difference]: Start difference. First operand 435 states and 596 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:53,308 INFO L93 Difference]: Finished difference Result 864 states and 1185 transitions. [2025-02-06 18:14:53,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:14:53,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-02-06 18:14:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:53,312 INFO L225 Difference]: With dead ends: 864 [2025-02-06 18:14:53,312 INFO L226 Difference]: Without dead ends: 438 [2025-02-06 18:14:53,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:14:53,313 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 106 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:53,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1071 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-02-06 18:14:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2025-02-06 18:14:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 425 states have (on average 1.371764705882353) internal successors, (583), 430 states have internal predecessors, (583), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 589 transitions. [2025-02-06 18:14:53,322 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 589 transitions. Word has length 81 [2025-02-06 18:14:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:53,322 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 589 transitions. [2025-02-06 18:14:53,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 589 transitions. [2025-02-06 18:14:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:14:53,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:53,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:14:53,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash 732461129, now seen corresponding path program 1 times [2025-02-06 18:14:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:53,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70570255] [2025-02-06 18:14:53,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:53,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:14:53,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:14:53,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:53,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:53,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:53,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70570255] [2025-02-06 18:14:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70570255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:14:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634724474] [2025-02-06 18:14:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:53,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:14:53,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:53,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:14:53,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:14:53,448 INFO L87 Difference]: Start difference. First operand 435 states and 589 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:53,531 INFO L93 Difference]: Finished difference Result 813 states and 1093 transitions. [2025-02-06 18:14:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:14:53,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-02-06 18:14:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:53,533 INFO L225 Difference]: With dead ends: 813 [2025-02-06 18:14:53,533 INFO L226 Difference]: Without dead ends: 387 [2025-02-06 18:14:53,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:14:53,534 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 9 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:53,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 938 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-06 18:14:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-02-06 18:14:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 377 states have (on average 1.3342175066312998) internal successors, (503), 382 states have internal predecessors, (503), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:53,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 509 transitions. [2025-02-06 18:14:53,550 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 509 transitions. Word has length 81 [2025-02-06 18:14:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:53,550 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 509 transitions. [2025-02-06 18:14:53,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 509 transitions. [2025-02-06 18:14:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:14:53,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:53,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:53,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:14:53,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:53,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash 294451626, now seen corresponding path program 1 times [2025-02-06 18:14:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:53,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875236343] [2025-02-06 18:14:53,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:53,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:14:53,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:14:53,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:53,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:53,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:53,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875236343] [2025-02-06 18:14:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875236343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:53,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:53,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:14:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105375506] [2025-02-06 18:14:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:53,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:14:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:53,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:14:53,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:14:53,688 INFO L87 Difference]: Start difference. First operand 387 states and 509 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:53,781 INFO L93 Difference]: Finished difference Result 1022 states and 1349 transitions. [2025-02-06 18:14:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:14:53,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-02-06 18:14:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:53,784 INFO L225 Difference]: With dead ends: 1022 [2025-02-06 18:14:53,784 INFO L226 Difference]: Without dead ends: 644 [2025-02-06 18:14:53,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:14:53,785 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 173 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:53,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 651 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-06 18:14:53,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2025-02-06 18:14:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 632 states have (on average 1.3306962025316456) internal successors, (841), 637 states have internal predecessors, (841), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:14:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 847 transitions. [2025-02-06 18:14:53,804 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 847 transitions. Word has length 81 [2025-02-06 18:14:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:53,804 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 847 transitions. [2025-02-06 18:14:53,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:14:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 847 transitions. [2025-02-06 18:14:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 18:14:53,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:53,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:53,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:14:53,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:53,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1064750457, now seen corresponding path program 1 times [2025-02-06 18:14:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644838799] [2025-02-06 18:14:53,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:53,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 18:14:53,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 18:14:53,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:53,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:14:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644838799] [2025-02-06 18:14:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644838799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:14:54,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:14:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585147990] [2025-02-06 18:14:54,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:54,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:14:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:54,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:14:54,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:14:54,071 INFO L87 Difference]: Start difference. First operand 642 states and 847 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:14:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:54,175 INFO L93 Difference]: Finished difference Result 707 states and 932 transitions. [2025-02-06 18:14:54,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:14:54,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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 96 [2025-02-06 18:14:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:54,178 INFO L225 Difference]: With dead ends: 707 [2025-02-06 18:14:54,178 INFO L226 Difference]: Without dead ends: 705 [2025-02-06 18:14:54,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:14:54,179 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 252 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:54,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 953 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-06 18:14:54,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-02-06 18:14:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 692 states have (on average 1.3265895953757225) internal successors, (918), 697 states have internal predecessors, (918), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 18:14:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 930 transitions. [2025-02-06 18:14:54,190 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 930 transitions. Word has length 96 [2025-02-06 18:14:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:54,191 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 930 transitions. [2025-02-06 18:14:54,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:14:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 930 transitions. [2025-02-06 18:14:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 18:14:54,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:54,192 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:54,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:14:54,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:54,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1753452887, now seen corresponding path program 1 times [2025-02-06 18:14:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717325733] [2025-02-06 18:14:54,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:54,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:14:54,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:14:54,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:54,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:14:54,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:54,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717325733] [2025-02-06 18:14:54,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717325733] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:14:54,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422551206] [2025-02-06 18:14:54,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:54,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:14:54,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:14:54,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:14:54,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:14:54,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:14:54,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:14:54,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:54,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:54,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 18:14:54,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:14:54,764 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:14:54,779 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:14:54,789 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 18:14:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:14:55,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:14:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422551206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:14:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:14:55,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120814290] [2025-02-06 18:14:55,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:55,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:14:55,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:55,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:14:55,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:14:55,353 INFO L87 Difference]: Start difference. First operand 705 states and 930 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:14:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:56,850 INFO L93 Difference]: Finished difference Result 1289 states and 1708 transitions. [2025-02-06 18:14:56,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:14:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 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-02-06 18:14:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:56,853 INFO L225 Difference]: With dead ends: 1289 [2025-02-06 18:14:56,853 INFO L226 Difference]: Without dead ends: 705 [2025-02-06 18:14:56,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:14:56,856 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 432 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:56,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 2220 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 18:14:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-06 18:14:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-02-06 18:14:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 692 states have (on average 1.3251445086705202) internal successors, (917), 697 states have internal predecessors, (917), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 18:14:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 929 transitions. [2025-02-06 18:14:56,874 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 929 transitions. Word has length 102 [2025-02-06 18:14:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 929 transitions. [2025-02-06 18:14:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:14:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 929 transitions. [2025-02-06 18:14:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:14:56,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:56,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:56,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:14:57,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:14:57,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:57,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash -150766756, now seen corresponding path program 1 times [2025-02-06 18:14:57,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:57,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340997678] [2025-02-06 18:14:57,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:57,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:57,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:14:57,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:14:57,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:57,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:14:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340997678] [2025-02-06 18:14:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340997678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:14:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983382439] [2025-02-06 18:14:57,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:57,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:14:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:14:57,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:14:57,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:14:57,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:14:57,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:14:57,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:57,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:57,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 18:14:57,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:14:57,706 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:14:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:14:57,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:14:57,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983382439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:57,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:14:57,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-02-06 18:14:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919497311] [2025-02-06 18:14:57,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:57,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:14:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:57,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:14:57,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:14:57,747 INFO L87 Difference]: Start difference. First operand 705 states and 929 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:14:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:14:57,912 INFO L93 Difference]: Finished difference Result 1250 states and 1649 transitions. [2025-02-06 18:14:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:14:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2025-02-06 18:14:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:14:57,916 INFO L225 Difference]: With dead ends: 1250 [2025-02-06 18:14:57,916 INFO L226 Difference]: Without dead ends: 716 [2025-02-06 18:14:57,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:14:57,917 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 301 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:14:57,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1562 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:14:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-06 18:14:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 708. [2025-02-06 18:14:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 694 states have (on average 1.3256484149855907) internal successors, (920), 700 states have internal predecessors, (920), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:14:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 934 transitions. [2025-02-06 18:14:57,931 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 934 transitions. Word has length 103 [2025-02-06 18:14:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:14:57,931 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 934 transitions. [2025-02-06 18:14:57,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:14:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 934 transitions. [2025-02-06 18:14:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 18:14:57,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:14:57,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:14:57,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:14:58,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:14:58,133 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:14:58,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:14:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1885743648, now seen corresponding path program 1 times [2025-02-06 18:14:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:14:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595676818] [2025-02-06 18:14:58,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:14:58,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:14:58,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:14:58,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:58,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:14:58,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:14:58,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595676818] [2025-02-06 18:14:58,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595676818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:14:58,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703753930] [2025-02-06 18:14:58,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:14:58,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:14:58,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:14:58,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:14:58,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:14:58,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:14:58,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:14:58,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:14:58,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:14:58,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 18:14:58,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:14:58,713 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:14:58,725 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:14:58,734 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 18:14:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:14:59,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:14:59,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703753930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:14:59,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:14:59,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2025-02-06 18:14:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683891399] [2025-02-06 18:14:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:14:59,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:14:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:14:59,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:14:59,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:14:59,251 INFO L87 Difference]: Start difference. First operand 708 states and 934 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:00,142 INFO L93 Difference]: Finished difference Result 1295 states and 1717 transitions. [2025-02-06 18:15:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:15:00,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 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 105 [2025-02-06 18:15:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:00,145 INFO L225 Difference]: With dead ends: 1295 [2025-02-06 18:15:00,145 INFO L226 Difference]: Without dead ends: 713 [2025-02-06 18:15:00,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2025-02-06 18:15:00,147 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 479 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:00,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1837 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 18:15:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-02-06 18:15:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 712. [2025-02-06 18:15:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 698 states have (on average 1.325214899713467) internal successors, (925), 704 states have internal predecessors, (925), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 939 transitions. [2025-02-06 18:15:00,165 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 939 transitions. Word has length 105 [2025-02-06 18:15:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:00,165 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 939 transitions. [2025-02-06 18:15:00,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 939 transitions. [2025-02-06 18:15:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 18:15:00,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:00,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:00,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 18:15:00,366 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,SelfDestructingSolverStorable11 [2025-02-06 18:15:00,366 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:00,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:00,367 INFO L85 PathProgramCache]: Analyzing trace with hash -297564758, now seen corresponding path program 1 times [2025-02-06 18:15:00,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:00,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547335288] [2025-02-06 18:15:00,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:00,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:00,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 18:15:00,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 18:15:00,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:00,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:15:00,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:00,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547335288] [2025-02-06 18:15:00,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547335288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:00,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:15:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:15:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935385691] [2025-02-06 18:15:00,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:00,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:15:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:00,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:15:00,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:15:00,584 INFO L87 Difference]: Start difference. First operand 712 states and 939 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:00,761 INFO L93 Difference]: Finished difference Result 1302 states and 1727 transitions. [2025-02-06 18:15:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:15:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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 106 [2025-02-06 18:15:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:00,763 INFO L225 Difference]: With dead ends: 1302 [2025-02-06 18:15:00,764 INFO L226 Difference]: Without dead ends: 718 [2025-02-06 18:15:00,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:15:00,765 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 5 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:00,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1124 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:15:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-02-06 18:15:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2025-02-06 18:15:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 704 states have (on average 1.3224431818181819) internal successors, (931), 710 states have internal predecessors, (931), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 945 transitions. [2025-02-06 18:15:00,778 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 945 transitions. Word has length 106 [2025-02-06 18:15:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:00,778 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 945 transitions. [2025-02-06 18:15:00,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:00,778 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 945 transitions. [2025-02-06 18:15:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 18:15:00,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:00,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:00,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:15:00,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:00,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:00,779 INFO L85 PathProgramCache]: Analyzing trace with hash -254816410, now seen corresponding path program 1 times [2025-02-06 18:15:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:00,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920216187] [2025-02-06 18:15:00,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:00,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:00,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 18:15:00,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 18:15:00,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:00,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 18:15:00,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920216187] [2025-02-06 18:15:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920216187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:15:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:15:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827823535] [2025-02-06 18:15:00,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:00,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:15:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:00,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:15:00,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:15:00,976 INFO L87 Difference]: Start difference. First operand 718 states and 945 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:01,256 INFO L93 Difference]: Finished difference Result 1308 states and 1731 transitions. [2025-02-06 18:15:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:15:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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 106 [2025-02-06 18:15:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:01,259 INFO L225 Difference]: With dead ends: 1308 [2025-02-06 18:15:01,259 INFO L226 Difference]: Without dead ends: 728 [2025-02-06 18:15:01,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:15:01,260 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 10 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:01,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1614 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:15:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-02-06 18:15:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2025-02-06 18:15:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 712 states have (on average 1.321629213483146) internal successors, (941), 718 states have internal predecessors, (941), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 955 transitions. [2025-02-06 18:15:01,273 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 955 transitions. Word has length 106 [2025-02-06 18:15:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:01,273 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 955 transitions. [2025-02-06 18:15:01,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 955 transitions. [2025-02-06 18:15:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 18:15:01,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:01,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:01,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:15:01,274 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2134761880, now seen corresponding path program 1 times [2025-02-06 18:15:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487210236] [2025-02-06 18:15:01,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:01,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:01,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 18:15:01,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 18:15:01,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:01,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:15:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487210236] [2025-02-06 18:15:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487210236] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163714778] [2025-02-06 18:15:01,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:01,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:01,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:01,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:01,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:15:01,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 18:15:01,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 18:15:01,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:01,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:01,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 18:15:01,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:01,877 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:15:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:15:02,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:15:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:15:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163714778] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:15:02,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:15:02,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-02-06 18:15:02,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111011688] [2025-02-06 18:15:02,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:15:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 18:15:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:02,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 18:15:02,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-06 18:15:02,413 INFO L87 Difference]: Start difference. First operand 726 states and 955 transitions. Second operand has 17 states, 17 states have (on average 12.117647058823529) internal successors, (206), 17 states have internal predecessors, (206), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 18:15:06,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 18:15:10,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 18:15:14,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 18:15:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:15,086 INFO L93 Difference]: Finished difference Result 1369 states and 1810 transitions. [2025-02-06 18:15:15,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 18:15:15,087 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.117647058823529) internal successors, (206), 17 states have internal predecessors, (206), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 107 [2025-02-06 18:15:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:15,090 INFO L225 Difference]: With dead ends: 1369 [2025-02-06 18:15:15,090 INFO L226 Difference]: Without dead ends: 823 [2025-02-06 18:15:15,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-02-06 18:15:15,093 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 914 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:15,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 3153 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 552 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2025-02-06 18:15:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-02-06 18:15:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 810. [2025-02-06 18:15:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 791 states have (on average 1.3286978508217446) internal successors, (1051), 797 states have internal predecessors, (1051), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-06 18:15:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1072 transitions. [2025-02-06 18:15:15,114 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1072 transitions. Word has length 107 [2025-02-06 18:15:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:15,114 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1072 transitions. [2025-02-06 18:15:15,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.117647058823529) internal successors, (206), 17 states have internal predecessors, (206), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 18:15:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1072 transitions. [2025-02-06 18:15:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 18:15:15,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:15,115 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:15,125 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-02-06 18:15:15,319 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,SelfDestructingSolverStorable14 [2025-02-06 18:15:15,319 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:15,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash 109253076, now seen corresponding path program 2 times [2025-02-06 18:15:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:15,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247767298] [2025-02-06 18:15:15,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:15:15,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:15,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-06 18:15:15,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 18:15:15,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:15:15,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 18:15:15,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:15,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247767298] [2025-02-06 18:15:15,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247767298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:15,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82787649] [2025-02-06 18:15:15,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:15:15,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:15,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:15,650 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:15,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:15:15,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-06 18:15:15,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 111 statements. [2025-02-06 18:15:15,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:15:15,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:15,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 18:15:15,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:15,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-02-06 18:15:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 18:15:15,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:15:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82787649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:15,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:15:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-02-06 18:15:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480902284] [2025-02-06 18:15:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:15,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:15:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:15,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:15:15,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:15:15,880 INFO L87 Difference]: Start difference. First operand 810 states and 1072 transitions. Second operand has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:15,923 INFO L93 Difference]: Finished difference Result 810 states and 1072 transitions. [2025-02-06 18:15:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:15:15,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 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 111 [2025-02-06 18:15:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:15,927 INFO L225 Difference]: With dead ends: 810 [2025-02-06 18:15:15,927 INFO L226 Difference]: Without dead ends: 809 [2025-02-06 18:15:15,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:15:15,928 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:15,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 658 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:15:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-06 18:15:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2025-02-06 18:15:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 791 states have (on average 1.3274336283185841) internal successors, (1050), 796 states have internal predecessors, (1050), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-06 18:15:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1071 transitions. [2025-02-06 18:15:15,949 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1071 transitions. Word has length 111 [2025-02-06 18:15:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:15,949 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1071 transitions. [2025-02-06 18:15:15,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.0) internal successors, (96), 3 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1071 transitions. [2025-02-06 18:15:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 18:15:15,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:15,951 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:15,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:15:16,151 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,SelfDestructingSolverStorable15 [2025-02-06 18:15:16,151 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:16,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash -908121342, now seen corresponding path program 1 times [2025-02-06 18:15:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:16,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921185849] [2025-02-06 18:15:16,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:16,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 18:15:16,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 18:15:16,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:16,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 18:15:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:16,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921185849] [2025-02-06 18:15:16,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921185849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:16,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418169045] [2025-02-06 18:15:16,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:16,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:16,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:16,433 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:16,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:15:16,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 18:15:16,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 18:15:16,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:16,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:16,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 18:15:16,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 18:15:16,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:15:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 18:15:17,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418169045] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:15:17,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:15:17,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-02-06 18:15:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780527099] [2025-02-06 18:15:17,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:15:17,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:15:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:17,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:15:17,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:15:17,031 INFO L87 Difference]: Start difference. First operand 809 states and 1071 transitions. Second operand has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:15:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:17,294 INFO L93 Difference]: Finished difference Result 1448 states and 1925 transitions. [2025-02-06 18:15:17,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:15:17,295 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2025-02-06 18:15:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:17,297 INFO L225 Difference]: With dead ends: 1448 [2025-02-06 18:15:17,298 INFO L226 Difference]: Without dead ends: 821 [2025-02-06 18:15:17,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2025-02-06 18:15:17,300 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 27 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:17,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1896 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:15:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-02-06 18:15:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 819. [2025-02-06 18:15:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 800 states have (on average 1.32875) internal successors, (1063), 806 states have internal predecessors, (1063), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-02-06 18:15:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1083 transitions. [2025-02-06 18:15:17,329 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1083 transitions. Word has length 112 [2025-02-06 18:15:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:17,329 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1083 transitions. [2025-02-06 18:15:17,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.153846153846153) internal successors, (119), 13 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:15:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1083 transitions. [2025-02-06 18:15:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 18:15:17,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:17,330 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:17,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 18:15:17,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:17,531 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:17,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash 743430274, now seen corresponding path program 2 times [2025-02-06 18:15:17,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:17,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800176313] [2025-02-06 18:15:17,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:15:17,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:17,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-02-06 18:15:17,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 18:15:17,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:15:17,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 18:15:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800176313] [2025-02-06 18:15:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800176313] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:18,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369880800] [2025-02-06 18:15:18,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:15:18,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:18,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:18,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:18,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:15:18,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-02-06 18:15:18,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 18:15:18,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:15:18,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:18,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 18:15:18,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 33 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 18:15:18,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:15:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 9 refuted. 1 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:15:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369880800] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:15:22,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:15:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-02-06 18:15:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974306892] [2025-02-06 18:15:22,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:15:22,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 18:15:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:22,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 18:15:22,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=357, Unknown=1, NotChecked=0, Total=462 [2025-02-06 18:15:22,652 INFO L87 Difference]: Start difference. First operand 819 states and 1083 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 18:15:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:23,283 INFO L93 Difference]: Finished difference Result 1417 states and 1879 transitions. [2025-02-06 18:15:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 18:15:23,283 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 116 [2025-02-06 18:15:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:23,289 INFO L225 Difference]: With dead ends: 1417 [2025-02-06 18:15:23,289 INFO L226 Difference]: Without dead ends: 776 [2025-02-06 18:15:23,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=383, Invalid=1176, Unknown=1, NotChecked=0, Total=1560 [2025-02-06 18:15:23,290 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 46 mSDsluCounter, 3765 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 4084 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:23,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 4084 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:15:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-02-06 18:15:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 772. [2025-02-06 18:15:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 755 states have (on average 1.3271523178807947) internal successors, (1002), 761 states have internal predecessors, (1002), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:23,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1016 transitions. [2025-02-06 18:15:23,306 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1016 transitions. Word has length 116 [2025-02-06 18:15:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:23,307 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1016 transitions. [2025-02-06 18:15:23,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 22 states have internal predecessors, (127), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 18:15:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1016 transitions. [2025-02-06 18:15:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 18:15:23,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:23,308 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:23,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 18:15:23,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 18:15:23,509 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:23,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1407027912, now seen corresponding path program 3 times [2025-02-06 18:15:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241625407] [2025-02-06 18:15:23,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:15:23,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:23,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 123 statements into 7 equivalence classes. [2025-02-06 18:15:23,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 99 of 123 statements. [2025-02-06 18:15:23,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 18:15:23,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 18:15:23,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:23,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241625407] [2025-02-06 18:15:23,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241625407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:23,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:15:23,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:15:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37397234] [2025-02-06 18:15:23,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:23,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:15:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:23,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:15:23,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:15:23,733 INFO L87 Difference]: Start difference. First operand 772 states and 1016 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:24,108 INFO L93 Difference]: Finished difference Result 1412 states and 1868 transitions. [2025-02-06 18:15:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:15:24,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 123 [2025-02-06 18:15:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:24,111 INFO L225 Difference]: With dead ends: 1412 [2025-02-06 18:15:24,111 INFO L226 Difference]: Without dead ends: 782 [2025-02-06 18:15:24,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:15:24,112 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 9 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:24,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1614 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:15:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-02-06 18:15:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 772. [2025-02-06 18:15:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 755 states have (on average 1.3271523178807947) internal successors, (1002), 761 states have internal predecessors, (1002), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1016 transitions. [2025-02-06 18:15:24,129 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1016 transitions. Word has length 123 [2025-02-06 18:15:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:24,129 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1016 transitions. [2025-02-06 18:15:24,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1016 transitions. [2025-02-06 18:15:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 18:15:24,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:24,130 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:24,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:15:24,130 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:24,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1800851865, now seen corresponding path program 1 times [2025-02-06 18:15:24,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:24,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599238724] [2025-02-06 18:15:24,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:24,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 18:15:24,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 18:15:24,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:24,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 118 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 18:15:24,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599238724] [2025-02-06 18:15:24,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599238724] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465779412] [2025-02-06 18:15:24,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:24,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:24,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:24,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:24,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 18:15:24,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 18:15:24,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 18:15:24,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:24,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:24,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 18:15:24,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 18:15:25,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:15:25,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465779412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:25,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:15:25,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-02-06 18:15:25,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934910571] [2025-02-06 18:15:25,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:25,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:15:25,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:25,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:15:25,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 18:15:25,021 INFO L87 Difference]: Start difference. First operand 772 states and 1016 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:25,292 INFO L93 Difference]: Finished difference Result 1422 states and 1882 transitions. [2025-02-06 18:15:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:15:25,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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 123 [2025-02-06 18:15:25,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:25,295 INFO L225 Difference]: With dead ends: 1422 [2025-02-06 18:15:25,295 INFO L226 Difference]: Without dead ends: 778 [2025-02-06 18:15:25,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-02-06 18:15:25,298 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 33 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:25,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1620 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:15:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-02-06 18:15:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 772. [2025-02-06 18:15:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 755 states have (on average 1.32317880794702) internal successors, (999), 761 states have internal predecessors, (999), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1013 transitions. [2025-02-06 18:15:25,319 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1013 transitions. Word has length 123 [2025-02-06 18:15:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:25,319 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1013 transitions. [2025-02-06 18:15:25,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1013 transitions. [2025-02-06 18:15:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 18:15:25,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:25,320 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:25,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 18:15:25,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:25,521 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:25,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash -65450831, now seen corresponding path program 1 times [2025-02-06 18:15:25,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564026462] [2025-02-06 18:15:25,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:25,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:15:25,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:15:25,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:25,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 118 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 18:15:26,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564026462] [2025-02-06 18:15:26,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564026462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:26,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40749922] [2025-02-06 18:15:26,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:26,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:26,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:26,073 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:26,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 18:15:26,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:15:26,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:15:26,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:26,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:26,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 18:15:26,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 18:15:27,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:15:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40749922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:15:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2025-02-06 18:15:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179866969] [2025-02-06 18:15:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:15:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:27,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:15:27,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-02-06 18:15:27,253 INFO L87 Difference]: Start difference. First operand 772 states and 1013 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:28,648 INFO L93 Difference]: Finished difference Result 1434 states and 1893 transitions. [2025-02-06 18:15:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:15:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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 125 [2025-02-06 18:15:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:28,651 INFO L225 Difference]: With dead ends: 1434 [2025-02-06 18:15:28,651 INFO L226 Difference]: Without dead ends: 802 [2025-02-06 18:15:28,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-02-06 18:15:28,652 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 14 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:28,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2655 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 18:15:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-06 18:15:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 796. [2025-02-06 18:15:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 779 states have (on average 1.3209242618741976) internal successors, (1029), 785 states have internal predecessors, (1029), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1043 transitions. [2025-02-06 18:15:28,683 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1043 transitions. Word has length 125 [2025-02-06 18:15:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:28,683 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1043 transitions. [2025-02-06 18:15:28,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1043 transitions. [2025-02-06 18:15:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 18:15:28,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:28,689 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:28,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 18:15:28,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:28,889 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:28,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash 849989269, now seen corresponding path program 1 times [2025-02-06 18:15:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:28,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33465535] [2025-02-06 18:15:28,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:28,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:15:29,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:15:29,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:29,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 118 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 18:15:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33465535] [2025-02-06 18:15:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33465535] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624903433] [2025-02-06 18:15:29,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:29,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:29,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:29,379 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:29,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 18:15:29,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:15:29,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:15:29,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:29,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:29,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 18:15:29,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 18:15:30,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:15:30,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624903433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:30,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:15:30,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-02-06 18:15:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638500985] [2025-02-06 18:15:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:30,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:15:30,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:30,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:15:30,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 18:15:30,136 INFO L87 Difference]: Start difference. First operand 796 states and 1043 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:30,471 INFO L93 Difference]: Finished difference Result 1450 states and 1911 transitions. [2025-02-06 18:15:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:15:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 125 [2025-02-06 18:15:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:30,474 INFO L225 Difference]: With dead ends: 1450 [2025-02-06 18:15:30,474 INFO L226 Difference]: Without dead ends: 806 [2025-02-06 18:15:30,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 18:15:30,480 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 6 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:30,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1614 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:15:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-06 18:15:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 796. [2025-02-06 18:15:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 779 states have (on average 1.3209242618741976) internal successors, (1029), 785 states have internal predecessors, (1029), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1043 transitions. [2025-02-06 18:15:30,540 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1043 transitions. Word has length 125 [2025-02-06 18:15:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:30,540 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1043 transitions. [2025-02-06 18:15:30,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1043 transitions. [2025-02-06 18:15:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 18:15:30,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:30,543 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:30,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 18:15:30,743 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,SelfDestructingSolverStorable21 [2025-02-06 18:15:30,744 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1795573003, now seen corresponding path program 1 times [2025-02-06 18:15:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:30,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252967356] [2025-02-06 18:15:30,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:30,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:15:30,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:15:30,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:30,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 18:15:31,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252967356] [2025-02-06 18:15:31,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252967356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:31,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:15:31,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 18:15:31,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984643565] [2025-02-06 18:15:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:31,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:15:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:31,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:15:31,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:15:31,083 INFO L87 Difference]: Start difference. First operand 796 states and 1043 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:31,480 INFO L93 Difference]: Finished difference Result 1472 states and 1940 transitions. [2025-02-06 18:15:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:15:31,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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 125 [2025-02-06 18:15:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:31,484 INFO L225 Difference]: With dead ends: 1472 [2025-02-06 18:15:31,484 INFO L226 Difference]: Without dead ends: 828 [2025-02-06 18:15:31,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:15:31,485 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 22 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:31,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1944 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:15:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-06 18:15:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 816. [2025-02-06 18:15:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 799 states have (on average 1.3178973717146434) internal successors, (1053), 805 states have internal predecessors, (1053), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1067 transitions. [2025-02-06 18:15:31,510 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1067 transitions. Word has length 125 [2025-02-06 18:15:31,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:31,510 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1067 transitions. [2025-02-06 18:15:31,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1067 transitions. [2025-02-06 18:15:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 18:15:31,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:31,512 INFO L218 NwaCegarLoop]: trace histogram [17, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:31,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:15:31,512 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2060408336, now seen corresponding path program 1 times [2025-02-06 18:15:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:31,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584164222] [2025-02-06 18:15:31,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:31,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:31,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 18:15:31,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 18:15:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 118 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 18:15:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584164222] [2025-02-06 18:15:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584164222] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686994041] [2025-02-06 18:15:32,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:32,140 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:32,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 18:15:32,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 18:15:32,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 18:15:32,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:32,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:32,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 18:15:32,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 97 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-06 18:15:32,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:15:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 118 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 18:15:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686994041] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:15:32,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:15:32,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-02-06 18:15:32,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686522780] [2025-02-06 18:15:32,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:15:32,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 18:15:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:32,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 18:15:32,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2025-02-06 18:15:32,965 INFO L87 Difference]: Start difference. First operand 816 states and 1067 transitions. Second operand has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 18:15:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:34,111 INFO L93 Difference]: Finished difference Result 1453 states and 1911 transitions. [2025-02-06 18:15:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 18:15:34,112 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 126 [2025-02-06 18:15:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:34,114 INFO L225 Difference]: With dead ends: 1453 [2025-02-06 18:15:34,114 INFO L226 Difference]: Without dead ends: 842 [2025-02-06 18:15:34,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=612, Invalid=1368, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 18:15:34,116 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 11 mSDsluCounter, 3610 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3940 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:34,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3940 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 18:15:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-02-06 18:15:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 834. [2025-02-06 18:15:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 817 states have (on average 1.3108935128518973) internal successors, (1071), 823 states have internal predecessors, (1071), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1085 transitions. [2025-02-06 18:15:34,144 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1085 transitions. Word has length 126 [2025-02-06 18:15:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:34,144 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1085 transitions. [2025-02-06 18:15:34,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 18:15:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1085 transitions. [2025-02-06 18:15:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 18:15:34,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:34,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:34,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 18:15:34,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:34,347 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:34,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1615579564, now seen corresponding path program 1 times [2025-02-06 18:15:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:34,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329910254] [2025-02-06 18:15:34,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:34,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:34,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 18:15:34,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 18:15:34,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:34,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:15:34,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329910254] [2025-02-06 18:15:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329910254] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521189510] [2025-02-06 18:15:34,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:34,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:34,648 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:34,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 18:15:34,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 18:15:34,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 18:15:34,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:34,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:34,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:15:34,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:34,985 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:15:35,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2025-02-06 18:15:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:15:35,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:15:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521189510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:35,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:15:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-06 18:15:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598347465] [2025-02-06 18:15:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:35,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:15:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:35,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:15:35,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:15:35,076 INFO L87 Difference]: Start difference. First operand 834 states and 1085 transitions. Second operand has 5 states, 4 states have (on average 31.75) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:15:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:35,174 INFO L93 Difference]: Finished difference Result 834 states and 1085 transitions. [2025-02-06 18:15:35,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:15:35,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.75) internal successors, (127), 5 states have internal predecessors, (127), 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 127 [2025-02-06 18:15:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:35,176 INFO L225 Difference]: With dead ends: 834 [2025-02-06 18:15:35,176 INFO L226 Difference]: Without dead ends: 833 [2025-02-06 18:15:35,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:15:35,177 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 274 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:35,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 894 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:15:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-06 18:15:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-02-06 18:15:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 817 states have (on average 1.3084455324357405) internal successors, (1069), 822 states have internal predecessors, (1069), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1083 transitions. [2025-02-06 18:15:35,197 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1083 transitions. Word has length 127 [2025-02-06 18:15:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:35,197 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1083 transitions. [2025-02-06 18:15:35,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.75) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:15:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1083 transitions. [2025-02-06 18:15:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 18:15:35,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:35,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:35,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 18:15:35,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:35,403 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:35,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1456641082, now seen corresponding path program 1 times [2025-02-06 18:15:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388616934] [2025-02-06 18:15:35,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:35,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:35,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 18:15:35,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 18:15:35,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:35,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:15:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388616934] [2025-02-06 18:15:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388616934] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134775903] [2025-02-06 18:15:35,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:35,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:35,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:35,612 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 18:15:35,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 18:15:35,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 18:15:35,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:35,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:35,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:15:35,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:35,955 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:15:36,032 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 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 18:15:36,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2025-02-06 18:15:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:15:36,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:15:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:15:36,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134775903] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:15:36,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:15:36,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-02-06 18:15:36,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502001214] [2025-02-06 18:15:36,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:15:36,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:15:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:36,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:15:36,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:15:36,282 INFO L87 Difference]: Start difference. First operand 833 states and 1083 transitions. Second operand has 13 states, 12 states have (on average 26.25) internal successors, (315), 13 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:15:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:36,545 INFO L93 Difference]: Finished difference Result 1425 states and 1869 transitions. [2025-02-06 18:15:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:15:36,546 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 26.25) internal successors, (315), 13 states have internal predecessors, (315), 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 128 [2025-02-06 18:15:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:36,549 INFO L225 Difference]: With dead ends: 1425 [2025-02-06 18:15:36,549 INFO L226 Difference]: Without dead ends: 1424 [2025-02-06 18:15:36,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-02-06 18:15:36,550 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 530 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:36,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 3082 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:15:36,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-02-06 18:15:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2025-02-06 18:15:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1408 states have (on average 1.3132102272727273) internal successors, (1849), 1413 states have internal predecessors, (1849), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1863 transitions. [2025-02-06 18:15:36,572 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1863 transitions. Word has length 128 [2025-02-06 18:15:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:36,572 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 1863 transitions. [2025-02-06 18:15:36,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 26.25) internal successors, (315), 13 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:15:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1863 transitions. [2025-02-06 18:15:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 18:15:36,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:36,573 INFO L218 NwaCegarLoop]: trace histogram [26, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:36,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 18:15:36,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 18:15:36,774 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:36,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1219248310, now seen corresponding path program 2 times [2025-02-06 18:15:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:36,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792801673] [2025-02-06 18:15:36,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:15:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:36,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-02-06 18:15:36,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 18:15:36,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:15:36,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 6 proven. 325 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 18:15:37,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792801673] [2025-02-06 18:15:37,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792801673] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379823525] [2025-02-06 18:15:37,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:15:37,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:37,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:37,503 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:37,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 18:15:37,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-02-06 18:15:38,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 18:15:38,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:15:38,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:38,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 18:15:38,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 74 proven. 286 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 18:15:38,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:15:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 195 proven. 55 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-02-06 18:15:39,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379823525] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:15:39,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:15:39,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 43 [2025-02-06 18:15:39,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288322848] [2025-02-06 18:15:39,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:15:39,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-06 18:15:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:39,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 18:15:39,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1510, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 18:15:39,154 INFO L87 Difference]: Start difference. First operand 1424 states and 1863 transitions. Second operand has 43 states, 43 states have (on average 3.488372093023256) internal successors, (150), 43 states have internal predecessors, (150), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 18:15:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:42,098 INFO L93 Difference]: Finished difference Result 2664 states and 3510 transitions. [2025-02-06 18:15:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 18:15:42,100 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.488372093023256) internal successors, (150), 43 states have internal predecessors, (150), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2025-02-06 18:15:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:42,105 INFO L225 Difference]: With dead ends: 2664 [2025-02-06 18:15:42,105 INFO L226 Difference]: Without dead ends: 1458 [2025-02-06 18:15:42,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1451, Invalid=5355, Unknown=0, NotChecked=0, Total=6806 [2025-02-06 18:15:42,108 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 59 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4531 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:42,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4531 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 18:15:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-02-06 18:15:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1450. [2025-02-06 18:15:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1434 states have (on average 1.3242677824267783) internal successors, (1899), 1439 states have internal predecessors, (1899), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1913 transitions. [2025-02-06 18:15:42,135 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1913 transitions. Word has length 135 [2025-02-06 18:15:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:42,135 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 1913 transitions. [2025-02-06 18:15:42,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.488372093023256) internal successors, (150), 43 states have internal predecessors, (150), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 18:15:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1913 transitions. [2025-02-06 18:15:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 18:15:42,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:42,137 INFO L218 NwaCegarLoop]: trace histogram [39, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:42,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 18:15:42,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 18:15:42,337 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:42,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2081800880, now seen corresponding path program 3 times [2025-02-06 18:15:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902273812] [2025-02-06 18:15:42,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:15:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:42,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 13 equivalence classes. [2025-02-06 18:15:42,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 102 of 148 statements. [2025-02-06 18:15:42,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 18:15:42,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-02-06 18:15:42,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902273812] [2025-02-06 18:15:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902273812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:15:42,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:15:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 18:15:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341875659] [2025-02-06 18:15:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:15:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:15:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:15:42,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:15:42,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:15:42,775 INFO L87 Difference]: Start difference. First operand 1450 states and 1913 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:47,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 18:15:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:15:47,519 INFO L93 Difference]: Finished difference Result 2737 states and 3621 transitions. [2025-02-06 18:15:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:15:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 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 148 [2025-02-06 18:15:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:15:47,524 INFO L225 Difference]: With dead ends: 2737 [2025-02-06 18:15:47,524 INFO L226 Difference]: Without dead ends: 1454 [2025-02-06 18:15:47,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:15:47,526 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 29 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:15:47,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2348 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 834 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 18:15:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-02-06 18:15:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1452. [2025-02-06 18:15:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1436 states have (on average 1.3224233983286908) internal successors, (1899), 1441 states have internal predecessors, (1899), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-06 18:15:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1913 transitions. [2025-02-06 18:15:47,568 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1913 transitions. Word has length 148 [2025-02-06 18:15:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:15:47,568 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 1913 transitions. [2025-02-06 18:15:47,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:15:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1913 transitions. [2025-02-06 18:15:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 18:15:47,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:15:47,569 INFO L218 NwaCegarLoop]: trace histogram [39, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:15:47,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 18:15:47,570 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:15:47,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:15:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2021426745, now seen corresponding path program 1 times [2025-02-06 18:15:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:15:47,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256894762] [2025-02-06 18:15:47,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:47,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:15:47,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 18:15:47,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 18:15:47,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:47,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 6 proven. 569 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-02-06 18:15:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:15:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256894762] [2025-02-06 18:15:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256894762] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:15:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945521929] [2025-02-06 18:15:48,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:15:48,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:15:48,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:15:48,523 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:15:48,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 18:15:48,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 18:15:51,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 18:15:51,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:15:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:15:51,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 348 conjuncts are in the unsatisfiable core [2025-02-06 18:15:51,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:15:51,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 18:15:52,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:15:52,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 18:15:52,269 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-06 18:15:52,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-06 18:15:52,384 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 18 treesize of output 10 [2025-02-06 18:15:52,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-06 18:15:53,420 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 18:15:53,420 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 50 treesize of output 45 [2025-02-06 18:15:53,424 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 24 treesize of output 11