./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c --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/recursified_nla-digbench/recursified_fermat2-ll.c -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 9ae1eacd45e2434e505261d43bb17259916099964617682d271ef41fa1c24d0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:35:49,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:35:49,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:35:49,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:35:49,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:35:49,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:35:49,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:35:49,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:35:49,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:35:49,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:35:49,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:35:49,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:35:49,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:35:49,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:35:49,176 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:35:49,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:35:49,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:35:49,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:35:49,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:35:49,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:35:49,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:35:49,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:35:49,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:35:49,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:35:49,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:35:49,178 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 -> 9ae1eacd45e2434e505261d43bb17259916099964617682d271ef41fa1c24d0c [2025-01-10 02:35:49,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:35:49,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:35:49,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:35:49,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:35:49,432 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:35:49,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c [2025-01-10 02:35:50,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6d6bdf7f/95a380330a4a404390a23a9889bc67a5/FLAGc2834350b [2025-01-10 02:35:51,052 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:35:51,052 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_fermat2-ll.c [2025-01-10 02:35:51,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6d6bdf7f/95a380330a4a404390a23a9889bc67a5/FLAGc2834350b [2025-01-10 02:35:51,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6d6bdf7f/95a380330a4a404390a23a9889bc67a5 [2025-01-10 02:35:51,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:35:51,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:35:51,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:35:51,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:35:51,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:35:51,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31155b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51, skipping insertion in model container [2025-01-10 02:35:51,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:35:51,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:35:51,488 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:35:51,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:35:51,521 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:35:51,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51 WrapperNode [2025-01-10 02:35:51,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:35:51,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:35:51,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:35:51,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:35:51,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,552 INFO L138 Inliner]: procedures = 16, calls = 60, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2025-01-10 02:35:51,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:35:51,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:35:51,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:35:51,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:35:51,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,581 INFO L175 MemorySlicer]: Split 36 memory accesses to 5 slices as follows [2, 8, 6, 10, 10]. 28 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 8 writes are split as follows [0, 3, 1, 2, 2]. [2025-01-10 02:35:51,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,588 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:35:51,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:35:51,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:35:51,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:35:51,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (1/1) ... [2025-01-10 02:35:51,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:35:51,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:51,632 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 02:35:51,642 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 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:35:51,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_33_to_42_0 [2025-01-10 02:35:51,657 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_33_to_42_0 [2025-01-10 02:35:51,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:35:51,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:35:51,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:35:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:35:51,754 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:35:51,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:35:52,075 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-10 02:35:52,075 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:35:52,089 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:35:52,089 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:35:52,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:35:52 BoogieIcfgContainer [2025-01-10 02:35:52,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:35:52,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:35:52,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:35:52,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:35:52,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:35:51" (1/3) ... [2025-01-10 02:35:52,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ed94cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:35:52, skipping insertion in model container [2025-01-10 02:35:52,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:51" (2/3) ... [2025-01-10 02:35:52,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ed94cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:35:52, skipping insertion in model container [2025-01-10 02:35:52,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:35:52" (3/3) ... [2025-01-10 02:35:52,098 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_fermat2-ll.c [2025-01-10 02:35:52,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:35:52,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_fermat2-ll.c that has 4 procedures, 144 locations, 1 initial locations, 0 loop locations, and 56 error locations. [2025-01-10 02:35:52,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:35:52,153 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;@6ab25850, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:35:52,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-01-10 02:35:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 135 states have internal predecessors, (139), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:35:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-01-10 02:35:52,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:52,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-01-10 02:35:52,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-01-10 02:35:52,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:52,165 INFO L85 PathProgramCache]: Analyzing trace with hash 110289, now seen corresponding path program 1 times [2025-01-10 02:35:52,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:52,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520299234] [2025-01-10 02:35:52,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:52,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:52,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 02:35:52,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 02:35:52,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:52,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:52,300 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 02:35:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520299234] [2025-01-10 02:35:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520299234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:52,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:35:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390120117] [2025-01-10 02:35:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:52,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:35:52,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:52,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:35:52,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:35:52,321 INFO L87 Difference]: Start difference. First operand has 144 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 135 states have internal predecessors, (139), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 02:35:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:52,390 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2025-01-10 02:35:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:35:52,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-01-10 02:35:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:52,396 INFO L225 Difference]: With dead ends: 269 [2025-01-10 02:35:52,397 INFO L226 Difference]: Without dead ends: 131 [2025-01-10 02:35:52,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:35:52,401 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 15 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:52,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 232 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:35:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-10 02:35:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-01-10 02:35:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.6986301369863013) internal successors, (124), 123 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:35:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2025-01-10 02:35:52,430 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 3 [2025-01-10 02:35:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:52,431 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2025-01-10 02:35:52,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 02:35:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2025-01-10 02:35:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 02:35:52,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:52,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 02:35:52,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:35:52,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-01-10 02:35:52,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:52,432 INFO L85 PathProgramCache]: Analyzing trace with hash 3419076, now seen corresponding path program 1 times [2025-01-10 02:35:52,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537218651] [2025-01-10 02:35:52,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:52,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 02:35:52,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 02:35:52,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:52,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:52,470 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 02:35:52,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:52,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537218651] [2025-01-10 02:35:52,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537218651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:52,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:52,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:35:52,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904879248] [2025-01-10 02:35:52,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:52,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:35:52,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:52,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:35:52,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:35:52,472 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:35:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:52,507 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2025-01-10 02:35:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:35:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 02:35:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:52,509 INFO L225 Difference]: With dead ends: 131 [2025-01-10 02:35:52,509 INFO L226 Difference]: Without dead ends: 127 [2025-01-10 02:35:52,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:35:52,509 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:52,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 219 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:35:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-10 02:35:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-10 02:35:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 73 states have (on average 1.643835616438356) internal successors, (120), 119 states have internal predecessors, (120), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:35:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2025-01-10 02:35:52,517 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 4 [2025-01-10 02:35:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:52,517 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2025-01-10 02:35:52,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:35:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2025-01-10 02:35:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:35:52,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:52,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:52,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:35:52,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-01-10 02:35:52,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash 791189384, now seen corresponding path program 1 times [2025-01-10 02:35:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:52,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539893799] [2025-01-10 02:35:52,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:52,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:52,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:35:52,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:35:52,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:52,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:35:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546085601] [2025-01-10 02:35:52,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:52,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:52,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:52,559 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 02:35:52,560 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 02:35:52,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:35:52,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:35:52,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:52,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:52,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:35:52,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:52,648 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 02:35:52,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539893799] [2025-01-10 02:35:52,649 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:35:52,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546085601] [2025-01-10 02:35:52,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546085601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:52,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:52,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:35:52,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679282256] [2025-01-10 02:35:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:52,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:35:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:52,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:35:52,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:35:52,650 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:35:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:52,674 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2025-01-10 02:35:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:35:52,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 02:35:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:52,676 INFO L225 Difference]: With dead ends: 127 [2025-01-10 02:35:52,676 INFO L226 Difference]: Without dead ends: 125 [2025-01-10 02:35:52,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 02:35:52,676 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:52,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 219 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:35:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-10 02:35:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-01-10 02:35:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 117 states have internal predecessors, (118), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:35:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2025-01-10 02:35:52,683 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 8 [2025-01-10 02:35:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:52,683 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2025-01-10 02:35:52,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:35:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2025-01-10 02:35:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 02:35:52,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:52,684 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] [2025-01-10 02:35:52,691 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 02:35:52,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:52,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-01-10 02:35:52,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1163428661, now seen corresponding path program 1 times [2025-01-10 02:35:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:52,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129877036] [2025-01-10 02:35:52,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:52,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:52,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:35:52,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:35:52,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:52,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:35:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743193669] [2025-01-10 02:35:52,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:52,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:52,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:52,917 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 02:35:52,920 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 02:35:52,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:35:52,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:35:52,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:52,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:52,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:35:52,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:52,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:35:53,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 02:35:53,076 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 02:35:53,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129877036] [2025-01-10 02:35:53,076 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:35:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743193669] [2025-01-10 02:35:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743193669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:53,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:35:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596019303] [2025-01-10 02:35:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:53,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:35:53,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:53,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:35:53,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:35:53,077 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 02:35:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:53,124 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2025-01-10 02:35:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:35:53,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 27 [2025-01-10 02:35:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:53,125 INFO L225 Difference]: With dead ends: 125 [2025-01-10 02:35:53,125 INFO L226 Difference]: Without dead ends: 124 [2025-01-10 02:35:53,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:35:53,126 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 109 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:53,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 328 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:35:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-01-10 02:35:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-01-10 02:35:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 116 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:35:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2025-01-10 02:35:53,136 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 27 [2025-01-10 02:35:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:53,140 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2025-01-10 02:35:53,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 02:35:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2025-01-10 02:35:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:35:53,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:53,141 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] [2025-01-10 02:35:53,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:35:53,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:53,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_42_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_42_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-01-10 02:35:53,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1706549978, now seen corresponding path program 1 times [2025-01-10 02:35:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:53,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329540617] [2025-01-10 02:35:53,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:53,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:53,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:35:53,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:35:53,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:53,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat