./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-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_FNV_test2-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:15:12,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:15:12,848 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:15:12,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:15:12,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:15:12,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:15:12,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:15:12,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:15:12,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:15:12,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:15:12,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:15:12,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:15:12,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:15:12,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:15:12,881 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:15:12,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:15:12,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:15:12,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:15:12,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:15:12,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:15:12,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:15:12,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:15:12,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:15:12,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:15:12,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:15:12,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:15:12,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:15:12,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:15:12,885 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 -> c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e [2025-01-10 06:15:13,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:15:13,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:15:13,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:15:13,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:15:13,119 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:15:13,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2025-01-10 06:15:14,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be440bbda/f217df19844f4d459cd6f099d147db6a/FLAG5bc52e475 [2025-01-10 06:15:14,567 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:15:14,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2025-01-10 06:15:14,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be440bbda/f217df19844f4d459cd6f099d147db6a/FLAG5bc52e475 [2025-01-10 06:15:14,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be440bbda/f217df19844f4d459cd6f099d147db6a [2025-01-10 06:15:14,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:15:14,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:15:14,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:15:14,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:15:14,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:15:14,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:15:14" (1/1) ... [2025-01-10 06:15:14,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ead840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:14, skipping insertion in model container [2025-01-10 06:15:14,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:15:14" (1/1) ... [2025-01-10 06:15:14,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:15:15,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:15:15,144 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:15:15,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:15:15,281 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:15:15,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15 WrapperNode [2025-01-10 06:15:15,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:15:15,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:15:15,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:15:15,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:15:15,291 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:15:15" (1/1) ... [2025-01-10 06:15:15,316 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:15:15" (1/1) ... [2025-01-10 06:15:15,357 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1272 [2025-01-10 06:15:15,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:15:15,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:15:15,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:15:15,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:15:15,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,419 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-01-10 06:15:15,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:15:15,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:15:15,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:15:15,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:15:15,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (1/1) ... [2025-01-10 06:15:15,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:15:15,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:15:15,516 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:15:15,521 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:15:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 06:15:15,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 06:15:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:15:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:15:15,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:15:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:15:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:15:15,541 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:15:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:15:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:15:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:15:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:15:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:15:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:15:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:15:15,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:15:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:15:15,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:15:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:15:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:15:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:15:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:15:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:15:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:15:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:15:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:15:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:15:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:15:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:15:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:15:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:15:15,725 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:15:15,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:15:16,912 INFO L? ?]: Removed 313 outVars from TransFormulas that were not future-live. [2025-01-10 06:15:16,913 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:15:16,922 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:15:16,923 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 06:15:16,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:15:16 BoogieIcfgContainer [2025-01-10 06:15:16,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:15:16,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:15:16,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:15:16,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:15:16,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:15:14" (1/3) ... [2025-01-10 06:15:16,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba72c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:15:16, skipping insertion in model container [2025-01-10 06:15:16,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:15:15" (2/3) ... [2025-01-10 06:15:16,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba72c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:15:16, skipping insertion in model container [2025-01-10 06:15:16,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:15:16" (3/3) ... [2025-01-10 06:15:16,929 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-1.i [2025-01-10 06:15:16,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:15:16,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test2-1.i that has 6 procedures, 405 locations, 1 initial locations, 33 loop locations, and 8 error locations. [2025-01-10 06:15:16,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:15:16,995 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;@139c760a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:15:16,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 06:15:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 375 states have (on average 1.6186666666666667) internal successors, (607), 390 states have internal predecessors, (607), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 06:15:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:15:17,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:17,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:15:17,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:17,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:17,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1000487724, now seen corresponding path program 1 times [2025-01-10 06:15:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294174986] [2025-01-10 06:15:17,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:17,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:15:17,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:15:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:15:17,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084665923] [2025-01-10 06:15:17,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:17,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:15:17,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:15:17,099 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:15:17,106 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:15:17,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:15:17,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:15:17,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:17,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:17,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:15:17,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:15:17,247 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:15:17,291 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:15:17,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:15:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:17,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294174986] [2025-01-10 06:15:17,292 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:15:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084665923] [2025-01-10 06:15:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084665923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:15:17,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:15:17,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:15:17,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12874397] [2025-01-10 06:15:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:15:17,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:15:17,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:15:17,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:15:17,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:15:17,310 INFO L87 Difference]: Start difference. First operand has 397 states, 375 states have (on average 1.6186666666666667) internal successors, (607), 390 states have internal predecessors, (607), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:15:17,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:15:17,462 INFO L93 Difference]: Finished difference Result 1169 states and 1871 transitions. [2025-01-10 06:15:17,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:15:17,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 06:15:17,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:15:17,476 INFO L225 Difference]: With dead ends: 1169 [2025-01-10 06:15:17,478 INFO L226 Difference]: Without dead ends: 765 [2025-01-10 06:15:17,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:15:17,485 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 530 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:15:17,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1710 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:15:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-01-10 06:15:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 394. [2025-01-10 06:15:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 376 states have (on average 1.4654255319148937) internal successors, (551), 388 states have internal predecessors, (551), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 06:15:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 567 transitions. [2025-01-10 06:15:17,536 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 567 transitions. Word has length 8 [2025-01-10 06:15:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:15:17,536 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 567 transitions. [2025-01-10 06:15:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:15:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 567 transitions. [2025-01-10 06:15:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 06:15:17,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:17,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:15:17,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:15:17,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 06:15:17,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:17,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 950348457, now seen corresponding path program 1 times [2025-01-10 06:15:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:17,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898088139] [2025-01-10 06:15:17,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:17,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:15:17,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:15:17,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:17,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:15:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035939961] [2025-01-10 06:15:17,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:17,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:15:17,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:15:17,770 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:15:17,779 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:15:17,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:15:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:15:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:17,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:15:17,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:15:17,895 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:15:17,921 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:15:17,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:15:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898088139] [2025-01-10 06:15:17,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:15:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035939961] [2025-01-10 06:15:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035939961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:15:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:15:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:15:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756573232] [2025-01-10 06:15:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:15:17,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:15:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:15:17,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:15:17,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:15:17,924 INFO L87 Difference]: Start difference. First operand 394 states and 567 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:15:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:15:18,083 INFO L93 Difference]: Finished difference Result 765 states and 1110 transitions. [2025-01-10 06:15:18,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:15:18,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-01-10 06:15:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:15:18,086 INFO L225 Difference]: With dead ends: 765 [2025-01-10 06:15:18,086 INFO L226 Difference]: Without dead ends: 764 [2025-01-10 06:15:18,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:15:18,088 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 526 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:15:18,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1689 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:15:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-01-10 06:15:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 395. [2025-01-10 06:15:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.4641909814323608) internal successors, (552), 389 states have internal predecessors, (552), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 06:15:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 568 transitions. [2025-01-10 06:15:18,114 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 568 transitions. Word has length 9 [2025-01-10 06:15:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:15:18,114 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 568 transitions. [2025-01-10 06:15:18,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:15:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 568 transitions. [2025-01-10 06:15:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 06:15:18,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:18,117 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] [2025-01-10 06:15:18,124 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:15:18,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:15:18,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:18,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash -425962322, now seen corresponding path program 1 times [2025-01-10 06:15:18,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:18,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746594073] [2025-01-10 06:15:18,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:18,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:18,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 06:15:18,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 06:15:18,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:18,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:18,650 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:15:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746594073] [2025-01-10 06:15:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746594073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:15:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:15:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:15:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004002552] [2025-01-10 06:15:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:15:18,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:15:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:15:18,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:15:18,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:15:18,652 INFO L87 Difference]: Start difference. First operand 395 states and 568 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:15:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:15:18,752 INFO L93 Difference]: Finished difference Result 942 states and 1371 transitions. [2025-01-10 06:15:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:15:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-01-10 06:15:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:15:18,755 INFO L225 Difference]: With dead ends: 942 [2025-01-10 06:15:18,755 INFO L226 Difference]: Without dead ends: 763 [2025-01-10 06:15:18,756 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:15:18,756 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 529 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:15:18,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1696 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:15:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-01-10 06:15:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 395. [2025-01-10 06:15:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.4615384615384615) internal successors, (551), 389 states have internal predecessors, (551), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 06:15:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 567 transitions. [2025-01-10 06:15:18,770 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 567 transitions. Word has length 63 [2025-01-10 06:15:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:15:18,770 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 567 transitions. [2025-01-10 06:15:18,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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:15:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 567 transitions. [2025-01-10 06:15:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 06:15:18,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:18,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:15:18,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:15:18,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:18,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1666939625, now seen corresponding path program 1 times [2025-01-10 06:15:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:18,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610499506] [2025-01-10 06:15:18,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:18,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 06:15:18,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 06:15:18,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:18,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:19,012 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:15:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:19,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610499506] [2025-01-10 06:15:19,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610499506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:15:19,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:15:19,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:15:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523215027] [2025-01-10 06:15:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:15:19,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:15:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:15:19,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:15:19,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:15:19,013 INFO L87 Difference]: Start difference. First operand 395 states and 567 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:15:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:15:19,082 INFO L93 Difference]: Finished difference Result 784 states and 1128 transitions. [2025-01-10 06:15:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:15:19,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-10 06:15:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:15:19,085 INFO L225 Difference]: With dead ends: 784 [2025-01-10 06:15:19,085 INFO L226 Difference]: Without dead ends: 398 [2025-01-10 06:15:19,087 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:15:19,087 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 105 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1506 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:15:19,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1506 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:15:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-01-10 06:15:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2025-01-10 06:15:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 377 states have (on average 1.442970822281167) internal successors, (544), 389 states have internal predecessors, (544), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 06:15:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 560 transitions. [2025-01-10 06:15:19,104 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 560 transitions. Word has length 81 [2025-01-10 06:15:19,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:15:19,104 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 560 transitions. [2025-01-10 06:15:19,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:15:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 560 transitions. [2025-01-10 06:15:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 06:15:19,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:19,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:15:19,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:15:19,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:19,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1538676899, now seen corresponding path program 1 times [2025-01-10 06:15:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73216995] [2025-01-10 06:15:19,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:19,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 06:15:19,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 06:15:19,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:19,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:19,262 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:15:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73216995] [2025-01-10 06:15:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73216995] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:15:19,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:15:19,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:15:19,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753064570] [2025-01-10 06:15:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:15:19,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:15:19,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:15:19,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:15:19,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:15:19,263 INFO L87 Difference]: Start difference. First operand 395 states and 560 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:15:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:15:19,312 INFO L93 Difference]: Finished difference Result 1060 states and 1527 transitions. [2025-01-10 06:15:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:15:19,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-10 06:15:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:15:19,315 INFO L225 Difference]: With dead ends: 1060 [2025-01-10 06:15:19,315 INFO L226 Difference]: Without dead ends: 674 [2025-01-10 06:15:19,315 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:15:19,316 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 352 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:15:19,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1287 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:15:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-01-10 06:15:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 670. [2025-01-10 06:15:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 647 states have (on average 1.465224111282844) internal successors, (948), 664 states have internal predecessors, (948), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 06:15:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 974 transitions. [2025-01-10 06:15:19,343 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 974 transitions. Word has length 81 [2025-01-10 06:15:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:15:19,344 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 974 transitions. [2025-01-10 06:15:19,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:15:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 974 transitions. [2025-01-10 06:15:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 06:15:19,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:19,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:15:19,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:15:19,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:19,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -485378817, now seen corresponding path program 1 times [2025-01-10 06:15:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:19,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557691874] [2025-01-10 06:15:19,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:19,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:19,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 06:15:19,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 06:15:19,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:19,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:19,847 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:15:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:19,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557691874] [2025-01-10 06:15:19,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557691874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:15:19,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:15:19,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:15:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902650823] [2025-01-10 06:15:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:15:19,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:15:19,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:15:19,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:15:19,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:15:19,850 INFO L87 Difference]: Start difference. First operand 670 states and 974 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:15:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:15:19,937 INFO L93 Difference]: Finished difference Result 931 states and 1354 transitions. [2025-01-10 06:15:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:15:19,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2025-01-10 06:15:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:15:19,945 INFO L225 Difference]: With dead ends: 931 [2025-01-10 06:15:19,945 INFO L226 Difference]: Without dead ends: 929 [2025-01-10 06:15:19,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:15:19,946 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 436 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:15:19,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1584 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:15:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-01-10 06:15:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 734. [2025-01-10 06:15:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 708 states have (on average 1.4491525423728813) internal successors, (1026), 725 states have internal predecessors, (1026), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:15:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1058 transitions. [2025-01-10 06:15:19,973 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1058 transitions. Word has length 96 [2025-01-10 06:15:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:15:19,973 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1058 transitions. [2025-01-10 06:15:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:15:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1058 transitions. [2025-01-10 06:15:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:15:19,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:19,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:15:19,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:15:19,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:19,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -843280996, now seen corresponding path program 1 times [2025-01-10 06:15:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108551882] [2025-01-10 06:15:19,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:20,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:15:20,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:15:20,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:20,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:15:20,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:20,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108551882] [2025-01-10 06:15:20,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108551882] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:15:20,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799477491] [2025-01-10 06:15:20,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:20,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:15:20,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:15:20,435 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:15:20,437 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:15:20,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:15:20,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:15:20,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:20,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:20,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 06:15:20,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:15:20,684 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:15:20,702 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:15:20,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-10 06:15:21,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:15:21,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2025-01-10 06:15:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:15:21,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:15:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799477491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:15:21,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:15:21,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:15:21,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955537615] [2025-01-10 06:15:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:15:21,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:15:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:15:21,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:15:21,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:15:21,334 INFO L87 Difference]: Start difference. First operand 734 states and 1058 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:15:25,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 06:15:30,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 06:15:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:15:32,002 INFO L93 Difference]: Finished difference Result 1627 states and 2355 transitions. [2025-01-10 06:15:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:15:32,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-01-10 06:15:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:15:32,006 INFO L225 Difference]: With dead ends: 1627 [2025-01-10 06:15:32,006 INFO L226 Difference]: Without dead ends: 981 [2025-01-10 06:15:32,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:15:32,007 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 806 mSDsluCounter, 2889 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-01-10 06:15:32,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 3423 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1173 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2025-01-10 06:15:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-01-10 06:15:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 767. [2025-01-10 06:15:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 741 states have (on average 1.4412955465587045) internal successors, (1068), 758 states have internal predecessors, (1068), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:15:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1100 transitions. [2025-01-10 06:15:32,025 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1100 transitions. Word has length 103 [2025-01-10 06:15:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:15:32,026 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1100 transitions. [2025-01-10 06:15:32,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:15:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1100 transitions. [2025-01-10 06:15:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:15:32,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:32,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:15:32,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:15:32,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:15:32,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:32,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1374349402, now seen corresponding path program 1 times [2025-01-10 06:15:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682624194] [2025-01-10 06:15:32,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:32,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:15:32,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:15:32,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:32,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:15:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682624194] [2025-01-10 06:15:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682624194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:15:32,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:15:32,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:15:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647625377] [2025-01-10 06:15:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:15:32,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:15:32,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:15:32,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:15:32,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:15:32,369 INFO L87 Difference]: Start difference. First operand 767 states and 1100 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:15:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:15:32,447 INFO L93 Difference]: Finished difference Result 1375 states and 1974 transitions. [2025-01-10 06:15:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:15:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-01-10 06:15:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:15:32,451 INFO L225 Difference]: With dead ends: 1375 [2025-01-10 06:15:32,451 INFO L226 Difference]: Without dead ends: 638 [2025-01-10 06:15:32,452 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:15:32,453 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 9 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:15:32,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1355 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:15:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-01-10 06:15:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2025-01-10 06:15:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 612 states have (on average 1.4133986928104576) internal successors, (865), 629 states have internal predecessors, (865), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:15:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 897 transitions. [2025-01-10 06:15:32,471 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 897 transitions. Word has length 103 [2025-01-10 06:15:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:15:32,472 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 897 transitions. [2025-01-10 06:15:32,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:15:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 897 transitions. [2025-01-10 06:15:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 06:15:32,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:15:32,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:15:32,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:15:32,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:15:32,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:15:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash 739130369, now seen corresponding path program 1 times [2025-01-10 06:15:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:15:32,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24204053] [2025-01-10 06:15:32,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:32,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:15:32,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:15:32,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:15:32,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:32,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:15:32,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:15:32,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24204053] [2025-01-10 06:15:32,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24204053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:15:32,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215832911] [2025-01-10 06:15:32,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:15:32,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:15:32,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:15:32,744 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:15:32,747 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:15:32,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:15:32,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:15:32,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:15:32,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:15:32,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:15:32,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:16:05,740 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 06:16:17,752 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 06:16:32,510 WARN L286 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 06:16:41,454 WARN L286 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 06:16:52,013 WARN L286 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 37 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)