./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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_FNV_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:11:17,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:11:17,920 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:11:17,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:11:17,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:11:17,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:11:17,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:11:17,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:11:17,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:11:17,958 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:11:17,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:11:17,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:11:17,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:11:17,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:11:17,958 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:11:17,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:11:17,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:11:17,960 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:11:17,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:11:17,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:11:17,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:11:17,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:11:17,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:11:17,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:11:17,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:11:17,961 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:11:18,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:11:18,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:11:18,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:11:18,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:11:18,200 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:11:18,201 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_FNV_nondet_test2-1.i [2025-02-06 18:11:19,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/009f703d6/a44c8fbd31c34148b4463d490e9b87b8/FLAGd68a0cb5f [2025-02-06 18:11:19,744 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:11:19,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2025-02-06 18:11:19,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/009f703d6/a44c8fbd31c34148b4463d490e9b87b8/FLAGd68a0cb5f [2025-02-06 18:11:19,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/009f703d6/a44c8fbd31c34148b4463d490e9b87b8 [2025-02-06 18:11:19,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:11:19,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:11:19,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:11:19,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:11:19,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:11:19,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:11:19" (1/1) ... [2025-02-06 18:11:19,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466d5b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:19, skipping insertion in model container [2025-02-06 18:11:19,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:11:19" (1/1) ... [2025-02-06 18:11:20,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:11:20,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:11:20,548 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:11:20,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:11:20,677 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:11:20,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20 WrapperNode [2025-02-06 18:11:20,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:11:20,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:11:20,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:11:20,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:11:20,687 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:11:20" (1/1) ... [2025-02-06 18:11:20,710 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:11:20" (1/1) ... [2025-02-06 18:11:20,764 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1247 [2025-02-06 18:11:20,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:11:20,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:11:20,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:11:20,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:11:20,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,851 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:11:20,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:11:20,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:11:20,897 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:11:20,897 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:11:20,898 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (1/1) ... [2025-02-06 18:11:20,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:11:20,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:20,933 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:11:20,939 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:11:20,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:11:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:11:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:11:20,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:11:20,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:11:20,957 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:11:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:11:20,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:11:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:11:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:11:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:11:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:11:20,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:11:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:11:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:11:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:11:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:11:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:11:20,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:11:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:11:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:11:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:11:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:11:20,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:11:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:11:20,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:11:20,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:11:21,161 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:11:21,164 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:11:22,439 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:11:22,558 INFO L? ?]: Removed 303 outVars from TransFormulas that were not future-live. [2025-02-06 18:11:22,558 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:11:22,615 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:11:22,617 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 18:11:22,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:11:22 BoogieIcfgContainer [2025-02-06 18:11:22,618 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:11:22,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:11:22,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:11:22,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:11:22,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:11:19" (1/3) ... [2025-02-06 18:11:22,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e2031b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:11:22, skipping insertion in model container [2025-02-06 18:11:22,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:11:20" (2/3) ... [2025-02-06 18:11:22,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e2031b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:11:22, skipping insertion in model container [2025-02-06 18:11:22,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:11:22" (3/3) ... [2025-02-06 18:11:22,627 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2025-02-06 18:11:22,643 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:11:22,644 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test2-1.i that has 4 procedures, 382 locations, 1 initial locations, 33 loop locations, and 6 error locations. [2025-02-06 18:11:22,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:11:22,716 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;@3e4a448a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:11:22,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:11:22,720 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:11:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:11:22,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:22,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:11:22,724 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:11:22,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash 206859316, now seen corresponding path program 1 times [2025-02-06 18:11:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981405377] [2025-02-06 18:11:22,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:22,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:22,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:11:22,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:11:22,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:22,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:22,855 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:11:22,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:22,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981405377] [2025-02-06 18:11:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981405377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:22,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:22,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:11:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16328464] [2025-02-06 18:11:22,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:22,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:11:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:22,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:11:22,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:11:22,880 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:11:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:23,026 INFO L93 Difference]: Finished difference Result 744 states and 1183 transitions. [2025-02-06 18:11:23,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:11:23,028 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:11:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:23,037 INFO L225 Difference]: With dead ends: 744 [2025-02-06 18:11:23,037 INFO L226 Difference]: Without dead ends: 368 [2025-02-06 18:11:23,041 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:11:23,043 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:11:23,045 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:11:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-02-06 18:11:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-02-06 18:11:23,094 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:11:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 531 transitions. [2025-02-06 18:11:23,099 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 531 transitions. Word has length 8 [2025-02-06 18:11:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:23,099 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 531 transitions. [2025-02-06 18:11:23,099 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:11:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 531 transitions. [2025-02-06 18:11:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 18:11:23,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:23,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:11:23,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:11:23,100 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:11:23,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 206860277, now seen corresponding path program 1 times [2025-02-06 18:11:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981544441] [2025-02-06 18:11:23,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:23,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:11:23,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:11:23,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:23,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 18:11:23,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587845853] [2025-02-06 18:11:23,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:23,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:23,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:23,133 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:11:23,135 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:11:23,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:11:23,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:11:23,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:23,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:23,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 18:11:23,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:23,313 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:11:23,371 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:11:23,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:11:23,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981544441] [2025-02-06 18:11:23,375 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 18:11:23,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587845853] [2025-02-06 18:11:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587845853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:23,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:11:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814263848] [2025-02-06 18:11:23,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:23,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:11:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:23,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:11:23,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:11:23,377 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:11:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:23,700 INFO L93 Difference]: Finished difference Result 729 states and 1055 transitions. [2025-02-06 18:11:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:11:23,701 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:11:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:23,706 INFO L225 Difference]: With dead ends: 729 [2025-02-06 18:11:23,706 INFO L226 Difference]: Without dead ends: 727 [2025-02-06 18:11:23,706 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:11:23,707 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 511 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:11:23,707 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.3s Time] [2025-02-06 18:11:23,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-06 18:11:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 374. [2025-02-06 18:11:23,735 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:11:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 538 transitions. [2025-02-06 18:11:23,736 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 538 transitions. Word has length 8 [2025-02-06 18:11:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:23,737 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 538 transitions. [2025-02-06 18:11:23,737 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:11:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 538 transitions. [2025-02-06 18:11:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 18:11:23,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:23,740 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:11:23,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 18:11:23,940 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:11:23,941 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:11:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2088669308, now seen corresponding path program 1 times [2025-02-06 18:11:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:23,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517492423] [2025-02-06 18:11:23,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:23,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:11:23,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:11:23,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:23,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:24,277 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:11:24,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:24,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517492423] [2025-02-06 18:11:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517492423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:24,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:24,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:11:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347719194] [2025-02-06 18:11:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:24,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:11:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:24,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:11:24,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:11:24,278 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:11:24,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:24,416 INFO L93 Difference]: Finished difference Result 491 states and 706 transitions. [2025-02-06 18:11:24,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:11:24,416 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:11:24,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:24,418 INFO L225 Difference]: With dead ends: 491 [2025-02-06 18:11:24,418 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 18:11:24,418 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:11:24,419 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:11:24,419 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:11:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 18:11:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-06 18:11:24,431 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:11:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 461 transitions. [2025-02-06 18:11:24,432 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 461 transitions. Word has length 66 [2025-02-06 18:11:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:24,433 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 461 transitions. [2025-02-06 18:11:24,433 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:11:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 461 transitions. [2025-02-06 18:11:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 18:11:24,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:24,435 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:11:24,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:11:24,435 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:11:24,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1922787910, now seen corresponding path program 1 times [2025-02-06 18:11:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:24,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632186912] [2025-02-06 18:11:24,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:24,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:11:24,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:11:24,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:24,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:24,596 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:11:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:24,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632186912] [2025-02-06 18:11:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632186912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:11:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434284378] [2025-02-06 18:11:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:24,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:11:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:24,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:11:24,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:11:24,597 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:11:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:24,727 INFO L93 Difference]: Finished difference Result 443 states and 612 transitions. [2025-02-06 18:11:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:11:24,727 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:11:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:24,731 INFO L225 Difference]: With dead ends: 443 [2025-02-06 18:11:24,732 INFO L226 Difference]: Without dead ends: 326 [2025-02-06 18:11:24,733 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:11:24,733 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:11:24,733 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:11:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-06 18:11:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-02-06 18:11:24,744 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:11:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 451 transitions. [2025-02-06 18:11:24,747 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 451 transitions. Word has length 66 [2025-02-06 18:11:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:24,748 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 451 transitions. [2025-02-06 18:11:24,748 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:11:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 451 transitions. [2025-02-06 18:11:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 18:11:24,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:24,751 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:11:24,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:11:24,751 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:11:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash 596970430, now seen corresponding path program 1 times [2025-02-06 18:11:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410416578] [2025-02-06 18:11:24,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:24,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:11:24,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:11:24,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:24,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:25,033 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:11:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410416578] [2025-02-06 18:11:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410416578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:25,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:11:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823322551] [2025-02-06 18:11:25,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:25,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:11:25,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:25,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:11:25,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:11:25,035 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:11:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:25,208 INFO L93 Difference]: Finished difference Result 631 states and 879 transitions. [2025-02-06 18:11:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:11:25,209 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:11:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:25,212 INFO L225 Difference]: With dead ends: 631 [2025-02-06 18:11:25,212 INFO L226 Difference]: Without dead ends: 629 [2025-02-06 18:11:25,212 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:11:25,213 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:11:25,213 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:11:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-02-06 18:11:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 435. [2025-02-06 18:11:25,227 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:11:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 596 transitions. [2025-02-06 18:11:25,229 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 596 transitions. Word has length 66 [2025-02-06 18:11:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:25,229 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 596 transitions. [2025-02-06 18:11:25,229 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:11:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 596 transitions. [2025-02-06 18:11:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:11:25,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:25,231 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:11:25,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:11:25,232 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:11:25,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2118404848, now seen corresponding path program 1 times [2025-02-06 18:11:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135161946] [2025-02-06 18:11:25,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:25,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:11:25,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:11:25,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:25,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:25,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:11:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:25,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135161946] [2025-02-06 18:11:25,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135161946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:25,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:11:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459533388] [2025-02-06 18:11:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:25,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:11:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:25,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:11:25,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:11:25,448 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:11:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:25,583 INFO L93 Difference]: Finished difference Result 864 states and 1185 transitions. [2025-02-06 18:11:25,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:11:25,584 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:11:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:25,586 INFO L225 Difference]: With dead ends: 864 [2025-02-06 18:11:25,586 INFO L226 Difference]: Without dead ends: 438 [2025-02-06 18:11:25,586 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:11:25,587 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:11:25,587 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:11:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-02-06 18:11:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2025-02-06 18:11:25,600 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:11:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 589 transitions. [2025-02-06 18:11:25,602 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 589 transitions. Word has length 81 [2025-02-06 18:11:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:25,603 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 589 transitions. [2025-02-06 18:11:25,603 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:11:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 589 transitions. [2025-02-06 18:11:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:11:25,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:25,606 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:11:25,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:11:25,606 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:11:25,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash 732461129, now seen corresponding path program 1 times [2025-02-06 18:11:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:25,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900647579] [2025-02-06 18:11:25,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:25,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:25,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:11:25,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:11:25,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:25,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:25,803 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:11:25,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900647579] [2025-02-06 18:11:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900647579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:25,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:11:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777544213] [2025-02-06 18:11:25,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:25,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:11:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:25,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:11:25,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:11:25,806 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:11:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:25,907 INFO L93 Difference]: Finished difference Result 813 states and 1093 transitions. [2025-02-06 18:11:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:11:25,908 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:11:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:25,910 INFO L225 Difference]: With dead ends: 813 [2025-02-06 18:11:25,910 INFO L226 Difference]: Without dead ends: 387 [2025-02-06 18:11:25,910 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:11:25,912 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:11:25,913 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:11:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-06 18:11:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-02-06 18:11:25,930 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:11:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 509 transitions. [2025-02-06 18:11:25,932 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 509 transitions. Word has length 81 [2025-02-06 18:11:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:25,932 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 509 transitions. [2025-02-06 18:11:25,933 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:11:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 509 transitions. [2025-02-06 18:11:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:11:25,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:25,934 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:11:25,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:11:25,935 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:11:25,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash 294451626, now seen corresponding path program 1 times [2025-02-06 18:11:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:25,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608122602] [2025-02-06 18:11:25,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:25,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:11:25,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:11:25,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:25,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:26,140 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:11:26,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:26,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608122602] [2025-02-06 18:11:26,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608122602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:26,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:26,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:11:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748463290] [2025-02-06 18:11:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:26,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:11:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:26,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:11:26,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:11:26,142 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:11:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:26,265 INFO L93 Difference]: Finished difference Result 1022 states and 1349 transitions. [2025-02-06 18:11:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:11:26,265 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:11:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:26,269 INFO L225 Difference]: With dead ends: 1022 [2025-02-06 18:11:26,269 INFO L226 Difference]: Without dead ends: 644 [2025-02-06 18:11:26,270 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:11:26,270 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:11:26,271 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:11:26,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-06 18:11:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2025-02-06 18:11:26,292 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:11:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 847 transitions. [2025-02-06 18:11:26,297 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 847 transitions. Word has length 81 [2025-02-06 18:11:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:26,297 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 847 transitions. [2025-02-06 18:11:26,297 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:11:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 847 transitions. [2025-02-06 18:11:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 18:11:26,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:26,300 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:11:26,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:11:26,301 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:11:26,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1064750457, now seen corresponding path program 1 times [2025-02-06 18:11:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:26,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596624159] [2025-02-06 18:11:26,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:26,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 18:11:26,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 18:11:26,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:26,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:26,747 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:11:26,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596624159] [2025-02-06 18:11:26,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596624159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:26,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:26,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:11:26,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666858541] [2025-02-06 18:11:26,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:26,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:11:26,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:26,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:11:26,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:11:26,749 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:11:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:26,899 INFO L93 Difference]: Finished difference Result 707 states and 932 transitions. [2025-02-06 18:11:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:11:26,900 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:11:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:26,903 INFO L225 Difference]: With dead ends: 707 [2025-02-06 18:11:26,903 INFO L226 Difference]: Without dead ends: 705 [2025-02-06 18:11:26,904 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:11:26,904 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:11:26,905 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:11:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-06 18:11:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-02-06 18:11:26,924 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:11:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 930 transitions. [2025-02-06 18:11:26,927 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 930 transitions. Word has length 96 [2025-02-06 18:11:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:26,928 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 930 transitions. [2025-02-06 18:11:26,928 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:11:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 930 transitions. [2025-02-06 18:11:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 18:11:26,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:26,929 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:11:26,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:11:26,930 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:11:26,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1753452887, now seen corresponding path program 1 times [2025-02-06 18:11:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:26,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671511226] [2025-02-06 18:11:26,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:26,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:11:27,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:11:27,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:27,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:27,481 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:11:27,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671511226] [2025-02-06 18:11:27,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671511226] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:11:27,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666119931] [2025-02-06 18:11:27,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:27,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:27,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:27,484 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:11:27,487 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:11:27,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:11:27,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:11:27,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:27,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:27,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 18:11:27,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:27,809 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:11:27,826 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:11:27,842 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:11:28,587 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:11:28,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:11:28,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666119931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:28,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:11:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:11:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469470792] [2025-02-06 18:11:28,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:28,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:11:28,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:28,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:11:28,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:11:28,589 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:11:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:30,457 INFO L93 Difference]: Finished difference Result 1289 states and 1708 transitions. [2025-02-06 18:11:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:11:30,458 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:11:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:30,461 INFO L225 Difference]: With dead ends: 1289 [2025-02-06 18:11:30,461 INFO L226 Difference]: Without dead ends: 705 [2025-02-06 18:11:30,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:11:30,463 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 432 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:11:30,463 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.6s Time] [2025-02-06 18:11:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-06 18:11:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2025-02-06 18:11:30,479 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:11:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 929 transitions. [2025-02-06 18:11:30,482 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 929 transitions. Word has length 102 [2025-02-06 18:11:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:30,482 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 929 transitions. [2025-02-06 18:11:30,482 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:11:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 929 transitions. [2025-02-06 18:11:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 18:11:30,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:30,484 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:11:30,493 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:11:30,687 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:11:30,688 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:11:30,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash -150766756, now seen corresponding path program 1 times [2025-02-06 18:11:30,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:30,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593619771] [2025-02-06 18:11:30,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:11:30,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:11:30,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:30,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:31,020 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:11:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593619771] [2025-02-06 18:11:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593619771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:11:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280368867] [2025-02-06 18:11:31,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:31,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:31,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:31,023 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:11:31,025 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:11:31,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 18:11:31,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 18:11:31,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:31,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:31,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 18:11:31,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:31,478 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:11:31,529 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:11:31,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:11:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280368867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:31,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:11:31,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-02-06 18:11:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078436909] [2025-02-06 18:11:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:31,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:11:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:31,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:11:31,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:11:31,534 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:11:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:31,786 INFO L93 Difference]: Finished difference Result 1250 states and 1649 transitions. [2025-02-06 18:11:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:11:31,787 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:11:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:31,791 INFO L225 Difference]: With dead ends: 1250 [2025-02-06 18:11:31,791 INFO L226 Difference]: Without dead ends: 716 [2025-02-06 18:11:31,792 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:11:31,792 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 301 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:11:31,793 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.2s Time] [2025-02-06 18:11:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-06 18:11:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 708. [2025-02-06 18:11:31,809 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:11:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 934 transitions. [2025-02-06 18:11:31,812 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 934 transitions. Word has length 103 [2025-02-06 18:11:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:31,813 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 934 transitions. [2025-02-06 18:11:31,813 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:11:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 934 transitions. [2025-02-06 18:11:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 18:11:31,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:31,814 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:11:31,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:11:32,014 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:11:32,015 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:11:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1885743648, now seen corresponding path program 1 times [2025-02-06 18:11:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:32,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103232016] [2025-02-06 18:11:32,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:32,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:11:32,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:11:32,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:32,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:32,410 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:11:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:32,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103232016] [2025-02-06 18:11:32,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103232016] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:11:32,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443333523] [2025-02-06 18:11:32,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:32,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:32,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:32,413 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:11:32,419 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:11:32,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 18:11:32,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 18:11:32,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:32,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:32,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 18:11:32,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:32,842 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:11:32,860 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:11:32,874 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:11:33,607 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:11:33,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:11:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443333523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:33,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:11:33,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2025-02-06 18:11:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131681409] [2025-02-06 18:11:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:33,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:11:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:33,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:11:33,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:11:33,612 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:11:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:34,849 INFO L93 Difference]: Finished difference Result 1295 states and 1717 transitions. [2025-02-06 18:11:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:11:34,849 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:11:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:34,852 INFO L225 Difference]: With dead ends: 1295 [2025-02-06 18:11:34,853 INFO L226 Difference]: Without dead ends: 713 [2025-02-06 18:11:34,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2025-02-06 18:11:34,855 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 479 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2025-02-06 18:11:34,855 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.8s Time] [2025-02-06 18:11:34,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-02-06 18:11:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 712. [2025-02-06 18:11:34,883 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:11:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 939 transitions. [2025-02-06 18:11:34,888 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 939 transitions. Word has length 105 [2025-02-06 18:11:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:34,889 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 939 transitions. [2025-02-06 18:11:34,889 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:11:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 939 transitions. [2025-02-06 18:11:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 18:11:34,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:34,891 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:11:34,901 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:11:35,093 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:11:35,093 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:11:35,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:35,094 INFO L85 PathProgramCache]: Analyzing trace with hash -297564758, now seen corresponding path program 1 times [2025-02-06 18:11:35,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:35,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157129693] [2025-02-06 18:11:35,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:35,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:35,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 18:11:35,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 18:11:35,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:35,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:35,427 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:11:35,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157129693] [2025-02-06 18:11:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157129693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:35,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:35,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:11:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636127316] [2025-02-06 18:11:35,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:35,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:11:35,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:35,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:11:35,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:11:35,429 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:11:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:35,677 INFO L93 Difference]: Finished difference Result 1302 states and 1727 transitions. [2025-02-06 18:11:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:11:35,678 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:11:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:35,681 INFO L225 Difference]: With dead ends: 1302 [2025-02-06 18:11:35,681 INFO L226 Difference]: Without dead ends: 718 [2025-02-06 18:11:35,682 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:11:35,682 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 5 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:11:35,683 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:11:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-02-06 18:11:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2025-02-06 18:11:35,699 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:11:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 945 transitions. [2025-02-06 18:11:35,702 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 945 transitions. Word has length 106 [2025-02-06 18:11:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:35,702 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 945 transitions. [2025-02-06 18:11:35,702 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:11:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 945 transitions. [2025-02-06 18:11:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 18:11:35,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:35,703 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:11:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:11:35,704 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:11:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash -254816410, now seen corresponding path program 1 times [2025-02-06 18:11:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508338116] [2025-02-06 18:11:35,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:35,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 18:11:35,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 18:11:35,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:35,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:36,018 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:11:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508338116] [2025-02-06 18:11:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508338116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:36,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:11:36,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:11:36,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613125863] [2025-02-06 18:11:36,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:36,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:11:36,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:36,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:11:36,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:11:36,021 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:11:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:36,384 INFO L93 Difference]: Finished difference Result 1308 states and 1731 transitions. [2025-02-06 18:11:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:11:36,385 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:11:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:36,388 INFO L225 Difference]: With dead ends: 1308 [2025-02-06 18:11:36,388 INFO L226 Difference]: Without dead ends: 728 [2025-02-06 18:11:36,389 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:11:36,389 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 10 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:11:36,390 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:11:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2025-02-06 18:11:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2025-02-06 18:11:36,405 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:11:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 955 transitions. [2025-02-06 18:11:36,408 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 955 transitions. Word has length 106 [2025-02-06 18:11:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:36,408 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 955 transitions. [2025-02-06 18:11:36,408 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:11:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 955 transitions. [2025-02-06 18:11:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 18:11:36,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:36,409 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:11:36,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:11:36,410 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:11:36,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2134761880, now seen corresponding path program 1 times [2025-02-06 18:11:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:36,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456758453] [2025-02-06 18:11:36,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:36,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:36,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 18:11:36,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 18:11:36,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:36,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:36,820 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:11:36,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:36,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456758453] [2025-02-06 18:11:36,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456758453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:11:36,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786279577] [2025-02-06 18:11:36,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:36,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:36,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:36,823 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:11:36,825 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:11:37,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 18:11:37,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 18:11:37,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:37,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:37,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 18:11:37,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:37,279 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:11:37,695 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:11:37,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:11:38,010 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:11:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786279577] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:11:38,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:11:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-02-06 18:11:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360756433] [2025-02-06 18:11:38,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:11:38,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 18:11:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:38,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 18:11:38,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-06 18:11:38,013 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:11:42,750 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:11:46,769 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:11:50,778 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:11:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:50,915 INFO L93 Difference]: Finished difference Result 1369 states and 1810 transitions. [2025-02-06 18:11:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 18:11:50,916 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:11:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:50,920 INFO L225 Difference]: With dead ends: 1369 [2025-02-06 18:11:50,920 INFO L226 Difference]: Without dead ends: 823 [2025-02-06 18:11:50,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-02-06 18:11:50,923 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 914 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s 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.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:11:50,923 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.6s Time] [2025-02-06 18:11:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-02-06 18:11:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 810. [2025-02-06 18:11:50,968 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:11:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1072 transitions. [2025-02-06 18:11:50,972 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1072 transitions. Word has length 107 [2025-02-06 18:11:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:50,972 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1072 transitions. [2025-02-06 18:11:50,972 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:11:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1072 transitions. [2025-02-06 18:11:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 18:11:50,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:50,974 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:11:50,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:11:51,174 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:11:51,175 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:11:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 109253076, now seen corresponding path program 2 times [2025-02-06 18:11:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049652577] [2025-02-06 18:11:51,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:11:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:51,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-06 18:11:51,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 18:11:51,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:11:51,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:51,554 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:11:51,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:51,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049652577] [2025-02-06 18:11:51,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049652577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:11:51,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390899443] [2025-02-06 18:11:51,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:11:51,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:51,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:51,557 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:11:51,559 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:11:51,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-06 18:11:51,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 111 statements. [2025-02-06 18:11:51,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:11:51,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:51,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 18:11:51,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:51,860 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:11:51,867 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:11:51,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:11:51,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390899443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:11:51,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:11:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-02-06 18:11:51,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976779954] [2025-02-06 18:11:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:11:51,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:11:51,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:51,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:11:51,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:11:51,868 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:11:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:51,926 INFO L93 Difference]: Finished difference Result 810 states and 1072 transitions. [2025-02-06 18:11:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:11:51,926 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:11:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:51,931 INFO L225 Difference]: With dead ends: 810 [2025-02-06 18:11:51,931 INFO L226 Difference]: Without dead ends: 809 [2025-02-06 18:11:51,931 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:11:51,932 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:11:51,932 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:11:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-06 18:11:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2025-02-06 18:11:51,957 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:11:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1071 transitions. [2025-02-06 18:11:51,960 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1071 transitions. Word has length 111 [2025-02-06 18:11:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:51,961 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1071 transitions. [2025-02-06 18:11:51,961 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:11:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1071 transitions. [2025-02-06 18:11:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 18:11:51,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:51,962 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:11:51,989 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:11:52,163 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:11:52,164 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:11:52,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -908121342, now seen corresponding path program 1 times [2025-02-06 18:11:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:52,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614851520] [2025-02-06 18:11:52,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:52,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 18:11:52,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 18:11:52,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:52,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:52,584 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:11:52,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:52,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614851520] [2025-02-06 18:11:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614851520] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:11:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489149770] [2025-02-06 18:11:52,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:11:52,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:52,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:52,588 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:11:52,589 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:11:52,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 18:11:53,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 18:11:53,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:11:53,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:53,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 18:11:53,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:53,249 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:11:53,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:11:53,352 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:11:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489149770] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:11:53,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:11:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-02-06 18:11:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993091341] [2025-02-06 18:11:53,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:11:53,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:11:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:53,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:11:53,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:11:53,354 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:11:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:11:53,648 INFO L93 Difference]: Finished difference Result 1448 states and 1925 transitions. [2025-02-06 18:11:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:11:53,649 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:11:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:11:53,654 INFO L225 Difference]: With dead ends: 1448 [2025-02-06 18:11:53,654 INFO L226 Difference]: Without dead ends: 821 [2025-02-06 18:11:53,655 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:11:53,655 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 27 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:11:53,655 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:11:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-02-06 18:11:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 819. [2025-02-06 18:11:53,679 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:11:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1083 transitions. [2025-02-06 18:11:53,682 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1083 transitions. Word has length 112 [2025-02-06 18:11:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:11:53,682 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1083 transitions. [2025-02-06 18:11:53,682 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:11:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1083 transitions. [2025-02-06 18:11:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 18:11:53,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:11:53,684 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:11:53,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 18:11:53,885 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:11:53,885 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:11:53,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:11:53,886 INFO L85 PathProgramCache]: Analyzing trace with hash 743430274, now seen corresponding path program 2 times [2025-02-06 18:11:53,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:11:53,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265628741] [2025-02-06 18:11:53,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:11:53,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:11:53,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-02-06 18:11:54,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 18:11:54,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:11:54,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:54,636 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:11:54,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:11:54,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265628741] [2025-02-06 18:11:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265628741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:11:54,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914655082] [2025-02-06 18:11:54,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:11:54,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:11:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:11:54,639 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:11:54,640 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:11:54,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-02-06 18:11:55,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 18:11:55,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:11:55,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:11:55,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 18:11:55,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:55,243 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:11:55,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:11:59,447 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:11:59,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914655082] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:11:59,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:11:59,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 22 [2025-02-06 18:11:59,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288550363] [2025-02-06 18:11:59,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:11:59,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 18:11:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:11:59,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 18:11:59,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=357, Unknown=1, NotChecked=0, Total=462 [2025-02-06 18:11:59,450 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:12:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:00,205 INFO L93 Difference]: Finished difference Result 1417 states and 1879 transitions. [2025-02-06 18:12:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 18:12:00,206 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:12:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:00,209 INFO L225 Difference]: With dead ends: 1417 [2025-02-06 18:12:00,209 INFO L226 Difference]: Without dead ends: 776 [2025-02-06 18:12:00,210 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:12:00,210 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 46 mSDsluCounter, 3765 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:12:00,211 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:12:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-02-06 18:12:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 772. [2025-02-06 18:12:00,232 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:12:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1016 transitions. [2025-02-06 18:12:00,235 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1016 transitions. Word has length 116 [2025-02-06 18:12:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:00,235 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1016 transitions. [2025-02-06 18:12:00,235 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:12:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1016 transitions. [2025-02-06 18:12:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 18:12:00,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:00,237 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:12:00,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 18:12:00,437 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:12:00,438 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:12:00,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1407027912, now seen corresponding path program 3 times [2025-02-06 18:12:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834924380] [2025-02-06 18:12:00,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:12:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:00,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 123 statements into 7 equivalence classes. [2025-02-06 18:12:00,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 99 of 123 statements. [2025-02-06 18:12:00,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 18:12:00,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:00,722 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:12:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834924380] [2025-02-06 18:12:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834924380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:12:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:12:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:12:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549258521] [2025-02-06 18:12:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:12:00,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:12:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:00,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:12:00,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:12:00,724 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:12:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:01,224 INFO L93 Difference]: Finished difference Result 1412 states and 1868 transitions. [2025-02-06 18:12:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:12:01,225 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:12:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:01,228 INFO L225 Difference]: With dead ends: 1412 [2025-02-06 18:12:01,228 INFO L226 Difference]: Without dead ends: 782 [2025-02-06 18:12:01,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:12:01,231 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 9 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:12:01,231 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.5s Time] [2025-02-06 18:12:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-02-06 18:12:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 772. [2025-02-06 18:12:01,256 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:12:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1016 transitions. [2025-02-06 18:12:01,261 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1016 transitions. Word has length 123 [2025-02-06 18:12:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:01,262 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1016 transitions. [2025-02-06 18:12:01,262 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:12:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1016 transitions. [2025-02-06 18:12:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 18:12:01,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:01,264 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:12:01,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:12:01,265 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:12:01,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1800851865, now seen corresponding path program 1 times [2025-02-06 18:12:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858370606] [2025-02-06 18:12:01,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:01,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 18:12:01,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 18:12:01,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:01,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:01,928 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:12:01,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858370606] [2025-02-06 18:12:01,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858370606] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:12:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067108222] [2025-02-06 18:12:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:01,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:12:01,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:12:01,932 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:12:01,934 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:12:02,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 18:12:02,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 18:12:02,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:02,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:02,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 18:12:02,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:12:02,602 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:12:02,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:12:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067108222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:12:02,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:12:02,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-02-06 18:12:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742955273] [2025-02-06 18:12:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:12:02,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:12:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:02,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:12:02,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 18:12:02,604 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:12:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:02,913 INFO L93 Difference]: Finished difference Result 1422 states and 1882 transitions. [2025-02-06 18:12:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:12:02,914 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:12:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:02,916 INFO L225 Difference]: With dead ends: 1422 [2025-02-06 18:12:02,916 INFO L226 Difference]: Without dead ends: 778 [2025-02-06 18:12:02,917 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:12:02,918 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:12:02,918 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.3s Time] [2025-02-06 18:12:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-02-06 18:12:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 772. [2025-02-06 18:12:02,946 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:12:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1013 transitions. [2025-02-06 18:12:02,949 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1013 transitions. Word has length 123 [2025-02-06 18:12:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:02,949 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1013 transitions. [2025-02-06 18:12:02,949 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:12:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1013 transitions. [2025-02-06 18:12:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 18:12:02,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:02,951 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:12:02,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 18:12:03,151 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:12:03,151 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:12:03,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash -65450831, now seen corresponding path program 1 times [2025-02-06 18:12:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:03,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663419130] [2025-02-06 18:12:03,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:03,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:12:03,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:12:03,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:03,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:03,947 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:12:03,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:03,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663419130] [2025-02-06 18:12:03,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663419130] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:12:03,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192283080] [2025-02-06 18:12:03,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:03,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:12:03,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:12:03,960 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:12:03,963 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:12:04,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:12:04,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:12:04,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:04,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:04,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 18:12:04,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:12:05,424 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:12:05,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:12:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192283080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:12:05,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:12:05,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2025-02-06 18:12:05,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202240179] [2025-02-06 18:12:05,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:12:05,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:12:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:05,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:12:05,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-02-06 18:12:05,427 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:12:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:06,718 INFO L93 Difference]: Finished difference Result 1434 states and 1893 transitions. [2025-02-06 18:12:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:12:06,719 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:12:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:06,722 INFO L225 Difference]: With dead ends: 1434 [2025-02-06 18:12:06,722 INFO L226 Difference]: Without dead ends: 802 [2025-02-06 18:12:06,723 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:12:06,724 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 14 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:12:06,724 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.3s Time] [2025-02-06 18:12:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-06 18:12:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 796. [2025-02-06 18:12:06,746 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:12:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1043 transitions. [2025-02-06 18:12:06,748 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1043 transitions. Word has length 125 [2025-02-06 18:12:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:06,748 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1043 transitions. [2025-02-06 18:12:06,749 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:12:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1043 transitions. [2025-02-06 18:12:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 18:12:06,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:06,750 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:12:06,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 18:12:06,951 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:12:06,951 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:12:06,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 849989269, now seen corresponding path program 1 times [2025-02-06 18:12:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471137304] [2025-02-06 18:12:06,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:06,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:12:07,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:12:07,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:07,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:07,658 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:12:07,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471137304] [2025-02-06 18:12:07,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471137304] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:12:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002867113] [2025-02-06 18:12:07,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:07,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:12:07,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:12:07,660 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:12:07,663 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:12:08,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:12:08,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:12:08,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:08,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:08,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 18:12:08,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:12:08,585 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:12:08,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:12:08,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002867113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:12:08,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:12:08,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-02-06 18:12:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784505954] [2025-02-06 18:12:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:12:08,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:12:08,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:08,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:12:08,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-06 18:12:08,587 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:12:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:09,056 INFO L93 Difference]: Finished difference Result 1450 states and 1911 transitions. [2025-02-06 18:12:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:12:09,056 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:12:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:09,060 INFO L225 Difference]: With dead ends: 1450 [2025-02-06 18:12:09,060 INFO L226 Difference]: Without dead ends: 806 [2025-02-06 18:12:09,061 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:12:09,062 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 6 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-02-06 18:12:09,062 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.4s Time] [2025-02-06 18:12:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-06 18:12:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 796. [2025-02-06 18:12:09,084 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:12:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1043 transitions. [2025-02-06 18:12:09,086 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1043 transitions. Word has length 125 [2025-02-06 18:12:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:09,086 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1043 transitions. [2025-02-06 18:12:09,086 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:12:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1043 transitions. [2025-02-06 18:12:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 18:12:09,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:09,088 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:12:09,108 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:12:09,288 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:12:09,289 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:12:09,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:09,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1795573003, now seen corresponding path program 1 times [2025-02-06 18:12:09,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:09,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932861698] [2025-02-06 18:12:09,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:09,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:09,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 18:12:09,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 18:12:09,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:09,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:09,758 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:12:09,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:09,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932861698] [2025-02-06 18:12:09,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932861698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:12:09,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:12:09,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 18:12:09,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527904406] [2025-02-06 18:12:09,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:12:09,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:12:09,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:09,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:12:09,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:12:09,760 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:12:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:10,339 INFO L93 Difference]: Finished difference Result 1472 states and 1940 transitions. [2025-02-06 18:12:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:12:10,339 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:12:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:10,343 INFO L225 Difference]: With dead ends: 1472 [2025-02-06 18:12:10,343 INFO L226 Difference]: Without dead ends: 828 [2025-02-06 18:12:10,344 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:12:10,344 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 22 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2025-02-06 18:12:10,344 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.5s Time] [2025-02-06 18:12:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-02-06 18:12:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 816. [2025-02-06 18:12:10,375 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:12:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1067 transitions. [2025-02-06 18:12:10,378 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1067 transitions. Word has length 125 [2025-02-06 18:12:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:10,379 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1067 transitions. [2025-02-06 18:12:10,379 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:12:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1067 transitions. [2025-02-06 18:12:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 18:12:10,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:10,381 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:12:10,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:12:10,381 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:12:10,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:10,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2060408336, now seen corresponding path program 1 times [2025-02-06 18:12:10,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:10,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344153299] [2025-02-06 18:12:10,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:10,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 18:12:10,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 18:12:10,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:10,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:11,089 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:12:11,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344153299] [2025-02-06 18:12:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344153299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:12:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263522886] [2025-02-06 18:12:11,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:12:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:12:11,091 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:12:11,092 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:12:11,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 18:12:11,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 18:12:11,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:11,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:11,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 18:12:11,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:12:11,778 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:12:11,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:12:12,063 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:12:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263522886] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:12:12,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:12:12,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-02-06 18:12:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392181531] [2025-02-06 18:12:12,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:12:12,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 18:12:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:12,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 18:12:12,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=545, Unknown=0, NotChecked=0, Total=756 [2025-02-06 18:12:12,065 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:12:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:13,360 INFO L93 Difference]: Finished difference Result 1453 states and 1911 transitions. [2025-02-06 18:12:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 18:12:13,361 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:12:13,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:13,365 INFO L225 Difference]: With dead ends: 1453 [2025-02-06 18:12:13,365 INFO L226 Difference]: Without dead ends: 842 [2025-02-06 18:12:13,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=612, Invalid=1368, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 18:12:13,367 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 11 mSDsluCounter, 3610 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:12:13,368 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:12:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-02-06 18:12:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 834. [2025-02-06 18:12:13,393 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:12:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1085 transitions. [2025-02-06 18:12:13,395 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1085 transitions. Word has length 126 [2025-02-06 18:12:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:13,396 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1085 transitions. [2025-02-06 18:12:13,396 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:12:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1085 transitions. [2025-02-06 18:12:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 18:12:13,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:13,397 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:12:13,410 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:12:13,598 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:12:13,598 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:12:13,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1615579564, now seen corresponding path program 1 times [2025-02-06 18:12:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:13,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705866275] [2025-02-06 18:12:13,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:13,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 18:12:13,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 18:12:13,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:13,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:13,933 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:12:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705866275] [2025-02-06 18:12:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705866275] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:12:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512121269] [2025-02-06 18:12:13,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:12:13,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:12:13,937 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:12:13,939 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:12:14,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 18:12:14,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 18:12:14,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:14,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:14,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:12:14,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:12:14,382 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:12:14,482 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:12:14,494 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:12:14,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:12:14,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512121269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:12:14,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:12:14,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-06 18:12:14,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587506779] [2025-02-06 18:12:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:12:14,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:12:14,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:14,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:12:14,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:12:14,495 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:12:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:14,598 INFO L93 Difference]: Finished difference Result 834 states and 1085 transitions. [2025-02-06 18:12:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:12:14,598 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:12:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:14,602 INFO L225 Difference]: With dead ends: 834 [2025-02-06 18:12:14,602 INFO L226 Difference]: Without dead ends: 833 [2025-02-06 18:12:14,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:12:14,603 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:12:14,604 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:12:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-06 18:12:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-02-06 18:12:14,631 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:12:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1083 transitions. [2025-02-06 18:12:14,634 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1083 transitions. Word has length 127 [2025-02-06 18:12:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:14,634 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1083 transitions. [2025-02-06 18:12:14,635 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:12:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1083 transitions. [2025-02-06 18:12:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 18:12:14,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:14,636 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:12:14,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 18:12:14,837 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:12:14,837 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:12:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1456641082, now seen corresponding path program 1 times [2025-02-06 18:12:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920005335] [2025-02-06 18:12:14,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:14,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 18:12:14,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 18:12:14,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:14,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:15,115 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:12:15,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920005335] [2025-02-06 18:12:15,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920005335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:12:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482454088] [2025-02-06 18:12:15,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:15,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:12:15,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:12:15,119 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:12:15,121 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:12:15,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 18:12:15,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 18:12:15,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:15,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:15,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:12:15,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:12:15,595 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:12:15,707 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:12:15,782 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:12:15,784 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:12:15,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:12:15,941 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:12:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482454088] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:12:15,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:12:15,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-02-06 18:12:15,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837611411] [2025-02-06 18:12:15,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:12:15,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 18:12:15,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:15,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 18:12:15,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:12:15,943 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:12:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:16,246 INFO L93 Difference]: Finished difference Result 1425 states and 1869 transitions. [2025-02-06 18:12:16,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:12:16,247 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:12:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:16,250 INFO L225 Difference]: With dead ends: 1425 [2025-02-06 18:12:16,250 INFO L226 Difference]: Without dead ends: 1424 [2025-02-06 18:12:16,251 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:12:16,251 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:12:16,251 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:12:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-02-06 18:12:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2025-02-06 18:12:16,282 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:12:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1863 transitions. [2025-02-06 18:12:16,285 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1863 transitions. Word has length 128 [2025-02-06 18:12:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:16,286 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 1863 transitions. [2025-02-06 18:12:16,286 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:12:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1863 transitions. [2025-02-06 18:12:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 18:12:16,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:16,287 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:12:16,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 18:12:16,492 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:12:16,492 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:12:16,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1219248310, now seen corresponding path program 2 times [2025-02-06 18:12:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808889909] [2025-02-06 18:12:16,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:12:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:16,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-02-06 18:12:16,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 18:12:16,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:12:16,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:17,563 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:12:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808889909] [2025-02-06 18:12:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808889909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:12:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717876700] [2025-02-06 18:12:17,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:12:17,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:12:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:12:17,566 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:12:17,568 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:12:17,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-02-06 18:12:18,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 18:12:18,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:12:18,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:18,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 18:12:18,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:12:19,211 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:12:19,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:12:19,734 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:12:19,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717876700] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:12:19,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:12:19,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 43 [2025-02-06 18:12:19,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038014276] [2025-02-06 18:12:19,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:12:19,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-06 18:12:19,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:19,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 18:12:19,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1510, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 18:12:19,736 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:12:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:23,605 INFO L93 Difference]: Finished difference Result 2664 states and 3510 transitions. [2025-02-06 18:12:23,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-06 18:12:23,606 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:12:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:23,610 INFO L225 Difference]: With dead ends: 2664 [2025-02-06 18:12:23,610 INFO L226 Difference]: Without dead ends: 1458 [2025-02-06 18:12:23,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1451, Invalid=5355, Unknown=0, NotChecked=0, Total=6806 [2025-02-06 18:12:23,613 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 59 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 18:12:23,613 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.7s Time] [2025-02-06 18:12:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-02-06 18:12:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1450. [2025-02-06 18:12:23,649 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:12:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1913 transitions. [2025-02-06 18:12:23,653 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1913 transitions. Word has length 135 [2025-02-06 18:12:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:23,653 INFO L471 AbstractCegarLoop]: Abstraction has 1450 states and 1913 transitions. [2025-02-06 18:12:23,653 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:12:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1913 transitions. [2025-02-06 18:12:23,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 18:12:23,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:23,655 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:12:23,680 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:12:23,855 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:12:23,856 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:12:23,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:23,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2081800880, now seen corresponding path program 3 times [2025-02-06 18:12:23,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:23,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889600563] [2025-02-06 18:12:23,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:12:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:23,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 13 equivalence classes. [2025-02-06 18:12:23,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 102 of 148 statements. [2025-02-06 18:12:23,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 18:12:23,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:24,475 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:12:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889600563] [2025-02-06 18:12:24,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889600563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:12:24,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:12:24,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 18:12:24,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655175166] [2025-02-06 18:12:24,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:12:24,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:12:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:12:24,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:12:24,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:12:24,477 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:12:28,743 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:12:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:12:29,333 INFO L93 Difference]: Finished difference Result 2737 states and 3621 transitions. [2025-02-06 18:12:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:12:29,334 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:12:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:12:29,338 INFO L225 Difference]: With dead ends: 2737 [2025-02-06 18:12:29,338 INFO L226 Difference]: Without dead ends: 1454 [2025-02-06 18:12:29,339 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:12:29,339 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 29 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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.7s IncrementalHoareTripleChecker+Time [2025-02-06 18:12:29,339 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.7s Time] [2025-02-06 18:12:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-02-06 18:12:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1452. [2025-02-06 18:12:29,368 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:12:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1913 transitions. [2025-02-06 18:12:29,371 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1913 transitions. Word has length 148 [2025-02-06 18:12:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:12:29,371 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 1913 transitions. [2025-02-06 18:12:29,371 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:12:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1913 transitions. [2025-02-06 18:12:29,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-06 18:12:29,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:12:29,373 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:12:29,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 18:12:29,373 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:12:29,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:12:29,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2021426745, now seen corresponding path program 1 times [2025-02-06 18:12:29,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:12:29,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113396560] [2025-02-06 18:12:29,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:29,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:12:29,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 18:12:29,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 18:12:29,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:29,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:30,571 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:12:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:12:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113396560] [2025-02-06 18:12:30,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113396560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:12:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40959561] [2025-02-06 18:12:30,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:12:30,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:12:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:12:30,573 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:12:30,574 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:12:31,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 18:12:34,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 18:12:34,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:12:34,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:12:34,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 348 conjuncts are in the unsatisfiable core [2025-02-06 18:12:34,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:12:34,703 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:12:35,006 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:12:35,010 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:12:35,031 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-06 18:12:35,032 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:12:35,166 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:12:35,173 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