./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-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 b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:29:39,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:29:39,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:29:39,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:29:39,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:29:39,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:29:39,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:29:39,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:29:39,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:29:39,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:29:39,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:29:39,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:29:39,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:29:39,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:29:39,836 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:29:39,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:29:39,837 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:29:39,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:29:39,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:29:39,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:29:39,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:29:39,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:29:39,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:29:39,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:29:39,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:29:39,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:29:39,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:29:39,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:29:39,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:29:39,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:29:39,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:29:39,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:29:39,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:29:39,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:29:39,840 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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2025-01-10 06:29:40,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:29:40,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:29:40,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:29:40,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:29:40,088 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:29:40,089 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_SFH_test4-1.i [2025-01-10 06:29:41,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be766ef65/c4a23c8223784bcd8ba29d576baa4959/FLAG622dbbacb [2025-01-10 06:29:41,850 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:29:41,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2025-01-10 06:29:41,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be766ef65/c4a23c8223784bcd8ba29d576baa4959/FLAG622dbbacb [2025-01-10 06:29:41,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be766ef65/c4a23c8223784bcd8ba29d576baa4959 [2025-01-10 06:29:41,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:29:41,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:29:41,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:29:41,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:29:41,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:29:41,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:29:41" (1/1) ... [2025-01-10 06:29:41,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f88293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:41, skipping insertion in model container [2025-01-10 06:29:41,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:29:41" (1/1) ... [2025-01-10 06:29:41,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:29:42,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:29:42,262 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:29:42,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:29:42,419 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:29:42,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42 WrapperNode [2025-01-10 06:29:42,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:29:42,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:29:42,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:29:42,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:29:42,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,496 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1551 [2025-01-10 06:29:42,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:29:42,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:29:42,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:29:42,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:29:42,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,600 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-01-10 06:29:42,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,630 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:29:42,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:29:42,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:29:42,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:29:42,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (1/1) ... [2025-01-10 06:29:42,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:29:42,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:29:42,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:29:42,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:29:42,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:29:42,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:29:42,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:29:42,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:29:42,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:29:42,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:29:42,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:29:42,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:29:42,711 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:29:42,711 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:29:42,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:29:42,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:29:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:29:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:29:42,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:29:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:29:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:29:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:29:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:29:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:29:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:29:42,900 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:29:42,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:29:44,150 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2025-01-10 06:29:44,151 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:29:44,168 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:29:44,169 INFO L312 CfgBuilder]: Removed 28 assume(true) statements. [2025-01-10 06:29:44,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:29:44 BoogieIcfgContainer [2025-01-10 06:29:44,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:29:44,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:29:44,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:29:44,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:29:44,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:29:41" (1/3) ... [2025-01-10 06:29:44,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fcb01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:29:44, skipping insertion in model container [2025-01-10 06:29:44,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:29:42" (2/3) ... [2025-01-10 06:29:44,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fcb01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:29:44, skipping insertion in model container [2025-01-10 06:29:44,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:29:44" (3/3) ... [2025-01-10 06:29:44,178 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2025-01-10 06:29:44,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:29:44,189 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test4-1.i that has 4 procedures, 436 locations, 1 initial locations, 36 loop locations, and 6 error locations. [2025-01-10 06:29:44,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:29:44,265 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;@6fabaa45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:29:44,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:29:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 432 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 423 states have internal predecessors, (657), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:29:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:29:44,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:44,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:29:44,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:44,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 45424403, now seen corresponding path program 1 times [2025-01-10 06:29:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:44,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267360885] [2025-01-10 06:29:44,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:44,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:29:44,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:29:44,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:44,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:29:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267360885] [2025-01-10 06:29:44,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267360885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:44,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:29:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:29:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570065838] [2025-01-10 06:29:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:44,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:29:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:44,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:29:44,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:29:44,518 INFO L87 Difference]: Start difference. First operand has 432 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 423 states have internal predecessors, (657), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:29:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:44,661 INFO L93 Difference]: Finished difference Result 1244 states and 2007 transitions. [2025-01-10 06:29:44,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:29:44,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 06:29:44,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:44,675 INFO L225 Difference]: With dead ends: 1244 [2025-01-10 06:29:44,675 INFO L226 Difference]: Without dead ends: 810 [2025-01-10 06:29:44,685 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-01-10 06:29:44,691 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 545 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:44,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1237 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:29:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-01-10 06:29:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 431. [2025-01-10 06:29:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.4534313725490196) internal successors, (593), 422 states have internal predecessors, (593), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:29:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 625 transitions. [2025-01-10 06:29:44,776 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 625 transitions. Word has length 5 [2025-01-10 06:29:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:44,776 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 625 transitions. [2025-01-10 06:29:44,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:29:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 625 transitions. [2025-01-10 06:29:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-10 06:29:44,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:44,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:44,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:29:44,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:44,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 191633172, now seen corresponding path program 1 times [2025-01-10 06:29:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226000282] [2025-01-10 06:29:44,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:44,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-10 06:29:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-10 06:29:44,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:44,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:29:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226000282] [2025-01-10 06:29:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226000282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:45,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:29:45,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:29:45,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176285014] [2025-01-10 06:29:45,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:45,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:29:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:45,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:29:45,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:29:45,438 INFO L87 Difference]: Start difference. First operand 431 states and 625 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:29:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:45,566 INFO L93 Difference]: Finished difference Result 858 states and 1246 transitions. [2025-01-10 06:29:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:29:45,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 149 [2025-01-10 06:29:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:45,574 INFO L225 Difference]: With dead ends: 858 [2025-01-10 06:29:45,574 INFO L226 Difference]: Without dead ends: 434 [2025-01-10 06:29:45,576 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-01-10 06:29:45,577 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 105 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:45,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1686 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:29:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-10 06:29:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2025-01-10 06:29:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.4362745098039216) internal successors, (586), 422 states have internal predecessors, (586), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:29:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 618 transitions. [2025-01-10 06:29:45,610 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 618 transitions. Word has length 149 [2025-01-10 06:29:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:45,611 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 618 transitions. [2025-01-10 06:29:45,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:29:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 618 transitions. [2025-01-10 06:29:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-10 06:29:45,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:45,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:45,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:29:45,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:45,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1530373384, now seen corresponding path program 1 times [2025-01-10 06:29:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:45,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096940517] [2025-01-10 06:29:45,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:45,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-10 06:29:45,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-10 06:29:45,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:45,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:29:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096940517] [2025-01-10 06:29:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096940517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:45,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:29:45,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:29:45,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31682700] [2025-01-10 06:29:45,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:45,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:29:45,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:45,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:29:45,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:29:45,879 INFO L87 Difference]: Start difference. First operand 431 states and 618 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:29:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:45,926 INFO L93 Difference]: Finished difference Result 981 states and 1415 transitions. [2025-01-10 06:29:45,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:29:45,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2025-01-10 06:29:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:45,935 INFO L225 Difference]: With dead ends: 981 [2025-01-10 06:29:45,936 INFO L226 Difference]: Without dead ends: 557 [2025-01-10 06:29:45,937 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-01-10 06:29:45,938 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 134 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:45,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1217 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:29:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-10 06:29:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-10 06:29:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 534 states have (on average 1.4438202247191012) internal successors, (771), 548 states have internal predecessors, (771), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:29:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 803 transitions. [2025-01-10 06:29:45,959 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 803 transitions. Word has length 149 [2025-01-10 06:29:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:45,960 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 803 transitions. [2025-01-10 06:29:45,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:29:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 803 transitions. [2025-01-10 06:29:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 06:29:45,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:45,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:45,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:29:45,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:45,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1176467834, now seen corresponding path program 1 times [2025-01-10 06:29:45,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:45,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949215035] [2025-01-10 06:29:45,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:46,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:29:46,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:29:46,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:46,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:29:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949215035] [2025-01-10 06:29:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949215035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:46,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:29:46,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:29:46,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030633235] [2025-01-10 06:29:46,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:46,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:29:46,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:46,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:29:46,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:29:46,274 INFO L87 Difference]: Start difference. First operand 557 states and 803 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:29:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:46,365 INFO L93 Difference]: Finished difference Result 939 states and 1348 transitions. [2025-01-10 06:29:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:29:46,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 164 [2025-01-10 06:29:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:46,368 INFO L225 Difference]: With dead ends: 939 [2025-01-10 06:29:46,369 INFO L226 Difference]: Without dead ends: 515 [2025-01-10 06:29:46,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:29:46,371 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 30 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:46,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1517 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:29:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-10 06:29:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-01-10 06:29:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 492 states have (on average 1.410569105691057) internal successors, (694), 506 states have internal predecessors, (694), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:29:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 726 transitions. [2025-01-10 06:29:46,382 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 726 transitions. Word has length 164 [2025-01-10 06:29:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:46,383 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 726 transitions. [2025-01-10 06:29:46,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:29:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 726 transitions. [2025-01-10 06:29:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 06:29:46,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:46,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:46,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:29:46,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:46,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2029148690, now seen corresponding path program 1 times [2025-01-10 06:29:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400217724] [2025-01-10 06:29:46,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:46,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:29:46,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:29:46,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:46,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:29:46,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:46,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400217724] [2025-01-10 06:29:46,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400217724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:46,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:29:46,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:29:46,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741865806] [2025-01-10 06:29:46,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:46,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:29:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:46,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:29:46,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:29:46,658 INFO L87 Difference]: Start difference. First operand 515 states and 726 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:29:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:46,731 INFO L93 Difference]: Finished difference Result 1042 states and 1457 transitions. [2025-01-10 06:29:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:29:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 164 [2025-01-10 06:29:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:46,739 INFO L225 Difference]: With dead ends: 1042 [2025-01-10 06:29:46,739 INFO L226 Difference]: Without dead ends: 660 [2025-01-10 06:29:46,740 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-01-10 06:29:46,741 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 243 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:46,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1050 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:29:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-10 06:29:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-10 06:29:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 634 states have (on average 1.3943217665615142) internal successors, (884), 648 states have internal predecessors, (884), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 06:29:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 922 transitions. [2025-01-10 06:29:46,769 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 922 transitions. Word has length 164 [2025-01-10 06:29:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:46,770 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 922 transitions. [2025-01-10 06:29:46,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:29:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 922 transitions. [2025-01-10 06:29:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-10 06:29:46,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:46,772 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:46,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:29:46,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 307289006, now seen corresponding path program 1 times [2025-01-10 06:29:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182881152] [2025-01-10 06:29:46,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:46,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-10 06:29:46,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-10 06:29:46,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:46,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:29:47,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:47,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182881152] [2025-01-10 06:29:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182881152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:47,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:29:47,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:29:47,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891313299] [2025-01-10 06:29:47,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:47,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:29:47,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:47,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:29:47,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:29:47,059 INFO L87 Difference]: Start difference. First operand 660 states and 922 transitions. Second operand has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:47,130 INFO L93 Difference]: Finished difference Result 726 states and 1008 transitions. [2025-01-10 06:29:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:29:47,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 179 [2025-01-10 06:29:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:47,134 INFO L225 Difference]: With dead ends: 726 [2025-01-10 06:29:47,135 INFO L226 Difference]: Without dead ends: 724 [2025-01-10 06:29:47,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:29:47,135 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 295 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:47,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1563 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:29:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-01-10 06:29:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-01-10 06:29:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 695 states have (on average 1.3841726618705037) internal successors, (962), 709 states have internal predecessors, (962), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-10 06:29:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1006 transitions. [2025-01-10 06:29:47,158 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1006 transitions. Word has length 179 [2025-01-10 06:29:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:47,159 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1006 transitions. [2025-01-10 06:29:47,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1006 transitions. [2025-01-10 06:29:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-10 06:29:47,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:47,161 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:47,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:29:47,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:47,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:47,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2067148494, now seen corresponding path program 1 times [2025-01-10 06:29:47,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:47,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5675976] [2025-01-10 06:29:47,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:47,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-10 06:29:47,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-10 06:29:47,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:47,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:29:47,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5675976] [2025-01-10 06:29:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5675976] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:29:47,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699525276] [2025-01-10 06:29:47,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:47,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:29:47,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:29:47,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:29:47,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:29:47,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-10 06:29:47,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-10 06:29:47,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:47,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:47,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:29:47,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:29:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:29:48,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:29:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:29:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699525276] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:29:48,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:29:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:29:48,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583860394] [2025-01-10 06:29:48,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:29:48,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:29:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:48,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:29:48,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:29:48,375 INFO L87 Difference]: Start difference. First operand 724 states and 1006 transitions. Second operand has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 06:29:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:48,537 INFO L93 Difference]: Finished difference Result 1101 states and 1538 transitions. [2025-01-10 06:29:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:29:48,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 183 [2025-01-10 06:29:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:48,543 INFO L225 Difference]: With dead ends: 1101 [2025-01-10 06:29:48,544 INFO L226 Difference]: Without dead ends: 1069 [2025-01-10 06:29:48,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:29:48,545 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 2308 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:48,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 3665 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:29:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-10 06:29:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2025-01-10 06:29:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1034 states have (on average 1.3820116054158607) internal successors, (1429), 1048 states have internal predecessors, (1429), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:29:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1485 transitions. [2025-01-10 06:29:48,589 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1485 transitions. Word has length 183 [2025-01-10 06:29:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:48,590 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1485 transitions. [2025-01-10 06:29:48,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 06:29:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1485 transitions. [2025-01-10 06:29:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-10 06:29:48,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:48,597 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:48,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:29:48,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:29:48,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:48,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash 636452437, now seen corresponding path program 1 times [2025-01-10 06:29:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:48,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098869320] [2025-01-10 06:29:48,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:48,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-10 06:29:49,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-10 06:29:49,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:49,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:29:49,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:49,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098869320] [2025-01-10 06:29:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098869320] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:29:49,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459920152] [2025-01-10 06:29:49,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:49,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:29:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:29:49,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:29:49,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:29:50,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-10 06:29:50,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-10 06:29:50,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:50,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:50,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-10 06:29:50,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:29:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:29:50,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:29:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459920152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:50,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:29:50,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-01-10 06:29:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640640523] [2025-01-10 06:29:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:50,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:29:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:50,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:29:50,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:29:50,379 INFO L87 Difference]: Start difference. First operand 1069 states and 1485 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:50,749 INFO L93 Difference]: Finished difference Result 2154 states and 2984 transitions. [2025-01-10 06:29:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:29:50,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-01-10 06:29:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:50,753 INFO L225 Difference]: With dead ends: 2154 [2025-01-10 06:29:50,753 INFO L226 Difference]: Without dead ends: 1171 [2025-01-10 06:29:50,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:29:50,755 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 12 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:50,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1675 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:29:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-01-10 06:29:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1159. [2025-01-10 06:29:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1124 states have (on average 1.3674377224199288) internal successors, (1537), 1138 states have internal predecessors, (1537), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:29:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1593 transitions. [2025-01-10 06:29:50,779 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1593 transitions. Word has length 185 [2025-01-10 06:29:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:50,779 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1593 transitions. [2025-01-10 06:29:50,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1593 transitions. [2025-01-10 06:29:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-10 06:29:50,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:50,781 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:50,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:29:50,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:29:50,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:50,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:50,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1439643846, now seen corresponding path program 1 times [2025-01-10 06:29:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:50,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604749795] [2025-01-10 06:29:50,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:50,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:51,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-10 06:29:51,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-10 06:29:51,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:51,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:29:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:51,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604749795] [2025-01-10 06:29:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604749795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:29:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:29:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381401705] [2025-01-10 06:29:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:51,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:29:51,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:51,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:29:51,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:29:51,408 INFO L87 Difference]: Start difference. First operand 1159 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:51,736 INFO L93 Difference]: Finished difference Result 2217 states and 3051 transitions. [2025-01-10 06:29:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:29:51,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-01-10 06:29:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:51,741 INFO L225 Difference]: With dead ends: 2217 [2025-01-10 06:29:51,741 INFO L226 Difference]: Without dead ends: 1177 [2025-01-10 06:29:51,743 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-01-10 06:29:51,743 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 8 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:51,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1701 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:29:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-01-10 06:29:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1171. [2025-01-10 06:29:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1136 states have (on average 1.3661971830985915) internal successors, (1552), 1150 states have internal predecessors, (1552), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:29:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1608 transitions. [2025-01-10 06:29:51,779 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1608 transitions. Word has length 187 [2025-01-10 06:29:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:51,780 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1608 transitions. [2025-01-10 06:29:51,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1608 transitions. [2025-01-10 06:29:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:29:51,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:51,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:51,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:29:51,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1353433191, now seen corresponding path program 1 times [2025-01-10 06:29:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:51,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132306750] [2025-01-10 06:29:51,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:51,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:29:52,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:29:52,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:52,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:29:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132306750] [2025-01-10 06:29:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132306750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:29:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905771840] [2025-01-10 06:29:52,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:52,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:29:52,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:29:52,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:29:52,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:29:52,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:29:53,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:29:53,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:53,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:53,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:29:53,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:29:53,061 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-01-10 06:29:53,087 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 21 treesize of output 20 [2025-01-10 06:29:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:29:53,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:29:53,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905771840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:29:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-10 06:29:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70279755] [2025-01-10 06:29:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:53,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:29:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:53,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:29:53,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:29:53,644 INFO L87 Difference]: Start difference. First operand 1171 states and 1608 transitions. Second operand has 12 states, 12 states have (on average 14.25) internal successors, (171), 12 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:56,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:56,729 INFO L93 Difference]: Finished difference Result 2239 states and 3074 transitions. [2025-01-10 06:29:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:29:56,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.25) internal successors, (171), 12 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-01-10 06:29:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:56,735 INFO L225 Difference]: With dead ends: 2239 [2025-01-10 06:29:56,735 INFO L226 Difference]: Without dead ends: 1188 [2025-01-10 06:29:56,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-01-10 06:29:56,738 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 936 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 3987 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:56,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 3987 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-10 06:29:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-01-10 06:29:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1167. [2025-01-10 06:29:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1132 states have (on average 1.36660777385159) internal successors, (1547), 1146 states have internal predecessors, (1547), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:29:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1603 transitions. [2025-01-10 06:29:56,769 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1603 transitions. Word has length 188 [2025-01-10 06:29:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:56,769 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1603 transitions. [2025-01-10 06:29:56,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.25) internal successors, (171), 12 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:56,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1603 transitions. [2025-01-10 06:29:56,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:29:56,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:56,771 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:56,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:29:56,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:29:56,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:56,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1386187183, now seen corresponding path program 1 times [2025-01-10 06:29:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912161039] [2025-01-10 06:29:56,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:57,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:29:57,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:29:57,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:57,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:29:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912161039] [2025-01-10 06:29:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912161039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:29:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:29:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607147586] [2025-01-10 06:29:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:57,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:29:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:57,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:29:57,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:29:57,320 INFO L87 Difference]: Start difference. First operand 1167 states and 1603 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:57,751 INFO L93 Difference]: Finished difference Result 2241 states and 3084 transitions. [2025-01-10 06:29:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:29:57,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-01-10 06:29:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:57,755 INFO L225 Difference]: With dead ends: 2241 [2025-01-10 06:29:57,756 INFO L226 Difference]: Without dead ends: 1200 [2025-01-10 06:29:57,757 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-01-10 06:29:57,757 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 12 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:57,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2438 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:29:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2025-01-10 06:29:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1191. [2025-01-10 06:29:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1156 states have (on average 1.3667820069204153) internal successors, (1580), 1170 states have internal predecessors, (1580), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:29:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1636 transitions. [2025-01-10 06:29:57,780 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1636 transitions. Word has length 188 [2025-01-10 06:29:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:57,780 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1636 transitions. [2025-01-10 06:29:57,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:29:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1636 transitions. [2025-01-10 06:29:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:29:57,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:57,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:57,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:29:57,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:57,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1742655251, now seen corresponding path program 1 times [2025-01-10 06:29:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:57,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697598678] [2025-01-10 06:29:57,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:57,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:57,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:29:58,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:29:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:29:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:58,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697598678] [2025-01-10 06:29:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697598678] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:29:58,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059331449] [2025-01-10 06:29:58,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:58,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:29:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:29:58,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:29:58,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:29:58,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:29:58,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:29:58,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:58,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:58,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:29:58,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:29:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:29:58,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:29:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059331449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:29:58,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:29:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:29:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688451059] [2025-01-10 06:29:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:29:58,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:29:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:29:58,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:29:58,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:29:58,921 INFO L87 Difference]: Start difference. First operand 1191 states and 1636 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:29:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:29:58,968 INFO L93 Difference]: Finished difference Result 2211 states and 3050 transitions. [2025-01-10 06:29:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:29:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2025-01-10 06:29:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:29:58,974 INFO L225 Difference]: With dead ends: 2211 [2025-01-10 06:29:58,974 INFO L226 Difference]: Without dead ends: 1194 [2025-01-10 06:29:58,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:29:58,976 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 0 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:29:58,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1571 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:29:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-01-10 06:29:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2025-01-10 06:29:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1158 states have (on average 1.3670120898100173) internal successors, (1583), 1173 states have internal predecessors, (1583), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-01-10 06:29:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1645 transitions. [2025-01-10 06:29:59,003 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1645 transitions. Word has length 188 [2025-01-10 06:29:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:29:59,003 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1645 transitions. [2025-01-10 06:29:59,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:29:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1645 transitions. [2025-01-10 06:29:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-10 06:29:59,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:29:59,005 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:29:59,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:29:59,205 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-01-10 06:29:59,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:29:59,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:29:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1425659603, now seen corresponding path program 1 times [2025-01-10 06:29:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:29:59,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139361587] [2025-01-10 06:29:59,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:59,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:29:59,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:29:59,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:29:59,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:29:59,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:29:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:29:59,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:29:59,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139361587] [2025-01-10 06:29:59,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139361587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:29:59,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854092856] [2025-01-10 06:29:59,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:29:59,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:29:59,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:29:59,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:29:59,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:30:00,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:30:00,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:30:00,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:00,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:00,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:30:00,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:30:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:30:00,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:30:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854092856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:30:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-10 06:30:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993116990] [2025-01-10 06:30:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:00,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:30:00,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:00,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:30:00,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:30:00,405 INFO L87 Difference]: Start difference. First operand 1194 states and 1645 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:00,885 INFO L93 Difference]: Finished difference Result 2275 states and 3139 transitions. [2025-01-10 06:30:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:30:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2025-01-10 06:30:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:00,891 INFO L225 Difference]: With dead ends: 2275 [2025-01-10 06:30:00,891 INFO L226 Difference]: Without dead ends: 1215 [2025-01-10 06:30:00,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:30:00,894 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 12 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:00,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2445 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:30:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-01-10 06:30:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1194. [2025-01-10 06:30:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1158 states have (on average 1.3670120898100173) internal successors, (1583), 1173 states have internal predecessors, (1583), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-01-10 06:30:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1645 transitions. [2025-01-10 06:30:00,943 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1645 transitions. Word has length 192 [2025-01-10 06:30:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:00,943 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1645 transitions. [2025-01-10 06:30:00,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1645 transitions. [2025-01-10 06:30:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:30:00,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:00,946 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:30:00,964 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-01-10 06:30:01,147 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,SelfDestructingSolverStorable12 [2025-01-10 06:30:01,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:01,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1214339002, now seen corresponding path program 1 times [2025-01-10 06:30:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717598435] [2025-01-10 06:30:01,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:01,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:30:01,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:30:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:30:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:01,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717598435] [2025-01-10 06:30:01,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717598435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:01,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:01,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:30:01,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152371142] [2025-01-10 06:30:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:01,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:30:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:01,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:30:01,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:30:01,567 INFO L87 Difference]: Start difference. First operand 1194 states and 1645 transitions. Second operand has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:02,112 INFO L93 Difference]: Finished difference Result 2288 states and 3152 transitions. [2025-01-10 06:30:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:30:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2025-01-10 06:30:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:02,116 INFO L225 Difference]: With dead ends: 2288 [2025-01-10 06:30:02,116 INFO L226 Difference]: Without dead ends: 1233 [2025-01-10 06:30:02,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:30:02,118 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 20 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:02,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3337 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:30:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-01-10 06:30:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1215. [2025-01-10 06:30:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1179 states have (on average 1.3655640373197626) internal successors, (1610), 1194 states have internal predecessors, (1610), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-01-10 06:30:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1672 transitions. [2025-01-10 06:30:02,139 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1672 transitions. Word has length 193 [2025-01-10 06:30:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:02,139 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1672 transitions. [2025-01-10 06:30:02,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1672 transitions. [2025-01-10 06:30:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:30:02,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:02,141 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:30:02,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:30:02,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:02,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:02,141 INFO L85 PathProgramCache]: Analyzing trace with hash -193581270, now seen corresponding path program 1 times [2025-01-10 06:30:02,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:02,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235121779] [2025-01-10 06:30:02,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:02,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:02,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:30:02,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:30:02,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:02,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:30:02,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:02,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235121779] [2025-01-10 06:30:02,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235121779] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:30:02,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230242030] [2025-01-10 06:30:02,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:02,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:02,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:02,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:30:02,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:30:03,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:30:03,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:30:03,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:03,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:03,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 06:30:03,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:30:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:30:03,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:30:03,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230242030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:03,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:30:03,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-01-10 06:30:03,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453439504] [2025-01-10 06:30:03,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:30:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:03,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:30:03,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:30:03,499 INFO L87 Difference]: Start difference. First operand 1215 states and 1672 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:04,098 INFO L93 Difference]: Finished difference Result 2323 states and 3197 transitions. [2025-01-10 06:30:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:30:04,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2025-01-10 06:30:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:04,102 INFO L225 Difference]: With dead ends: 2323 [2025-01-10 06:30:04,103 INFO L226 Difference]: Without dead ends: 1254 [2025-01-10 06:30:04,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:30:04,104 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 17 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2517 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:04,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2517 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:30:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-01-10 06:30:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1230. [2025-01-10 06:30:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1194 states have (on average 1.3634840871021776) internal successors, (1628), 1209 states have internal predecessors, (1628), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-01-10 06:30:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1690 transitions. [2025-01-10 06:30:04,131 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1690 transitions. Word has length 193 [2025-01-10 06:30:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:04,132 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1690 transitions. [2025-01-10 06:30:04,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1690 transitions. [2025-01-10 06:30:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-10 06:30:04,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:04,134 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:30:04,144 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-01-10 06:30:04,334 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,SelfDestructingSolverStorable14 [2025-01-10 06:30:04,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -384752995, now seen corresponding path program 1 times [2025-01-10 06:30:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:04,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089914189] [2025-01-10 06:30:04,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:04,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-10 06:30:04,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-10 06:30:04,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:04,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:30:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:04,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089914189] [2025-01-10 06:30:04,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089914189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:04,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:04,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:30:04,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601314386] [2025-01-10 06:30:04,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:04,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:30:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:04,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:30:04,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:30:04,760 INFO L87 Difference]: Start difference. First operand 1230 states and 1690 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:05,303 INFO L93 Difference]: Finished difference Result 2341 states and 3221 transitions. [2025-01-10 06:30:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:30:05,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 194 [2025-01-10 06:30:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:05,307 INFO L225 Difference]: With dead ends: 2341 [2025-01-10 06:30:05,308 INFO L226 Difference]: Without dead ends: 1257 [2025-01-10 06:30:05,309 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-01-10 06:30:05,309 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 26 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:05,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2920 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:30:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-01-10 06:30:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1239. [2025-01-10 06:30:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1203 states have (on average 1.3607647547797175) internal successors, (1637), 1218 states have internal predecessors, (1637), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-01-10 06:30:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1699 transitions. [2025-01-10 06:30:05,329 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1699 transitions. Word has length 194 [2025-01-10 06:30:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:05,329 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1699 transitions. [2025-01-10 06:30:05,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1699 transitions. [2025-01-10 06:30:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-10 06:30:05,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:05,331 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:30:05,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:30:05,331 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:05,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1193965625, now seen corresponding path program 1 times [2025-01-10 06:30:05,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:05,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519816348] [2025-01-10 06:30:05,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:05,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:05,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-10 06:30:05,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-10 06:30:05,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:05,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:30:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519816348] [2025-01-10 06:30:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519816348] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:30:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498850538] [2025-01-10 06:30:05,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:05,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:05,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:05,780 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:30:05,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:30:06,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-10 06:30:06,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-10 06:30:06,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:06,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:06,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 146 conjuncts are in the unsatisfiable core [2025-01-10 06:30:06,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:30:06,464 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-01-10 06:30:06,497 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-01-10 06:30:06,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2025-01-10 06:30:06,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2025-01-10 06:30:06,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-01-10 06:30:06,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-10 06:30:06,893 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-01-10 06:30:06,915 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-10 06:30:06,915 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-01-10 06:30:06,925 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-01-10 06:30:07,008 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-01-10 06:30:07,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 06:30:07,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 06:30:07,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:30:07,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 51 [2025-01-10 06:30:07,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 06:30:07,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2025-01-10 06:30:17,230 INFO L224 Elim1Store]: Index analysis took 1130 ms