./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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_prodbin-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 5ace794fa35bd3dd49302fe61957917bbb7565f1b1f34293812fc47531868d51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:04:53,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:04:53,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:04:53,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:04:53,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:04:53,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:04:53,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:04:53,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:04:53,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:04:53,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:04:53,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:04:53,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:04:53,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:04:53,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:04:53,775 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:04:53,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:04:53,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:04:53,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:04:53,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:04:53,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:04:53,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:04:53,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:04:53,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:04:53,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:04:53,776 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:04:53,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:04:53,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:04:53,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:04:53,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:04:53,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:04:53,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:04:53,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:04:53,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:04:53,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:04:53,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:04:53,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:04:53,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:04:53,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:04:53,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:04:53,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:04:53,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:04:53,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:04:53,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:04:53,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:04:53,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:04:53,780 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 -> 5ace794fa35bd3dd49302fe61957917bbb7565f1b1f34293812fc47531868d51 [2025-02-08 10:04:54,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:04:54,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:04:54,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:04:54,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:04:54,058 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:04:54,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c [2025-02-08 10:04:55,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4663c9aec/b94f0702a0e94a0a981aee18f08df11e/FLAGd6455ce68 [2025-02-08 10:04:55,610 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:04:55,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c [2025-02-08 10:04:55,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4663c9aec/b94f0702a0e94a0a981aee18f08df11e/FLAGd6455ce68 [2025-02-08 10:04:55,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4663c9aec/b94f0702a0e94a0a981aee18f08df11e [2025-02-08 10:04:55,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:04:55,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:04:55,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:04:55,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:04:55,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:04:55,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:04:55" (1/1) ... [2025-02-08 10:04:55,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fa28fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:55, skipping insertion in model container [2025-02-08 10:04:55,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:04:55" (1/1) ... [2025-02-08 10:04:55,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:04:56,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:04:56,048 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:04:56,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:04:56,080 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:04:56,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56 WrapperNode [2025-02-08 10:04:56,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:04:56,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:04:56,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:04:56,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:04:56,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,109 INFO L138 Inliner]: procedures = 16, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-02-08 10:04:56,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:04:56,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:04:56,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:04:56,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:04:56,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,132 INFO L175 MemorySlicer]: Split 29 memory accesses to 6 slices as follows [2, 5, 8, 5, 5, 4]. 28 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 2, 3, 2, 1, 1]. [2025-02-08 10:04:56,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:04:56,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:04:56,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:04:56,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:04:56,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (1/1) ... [2025-02-08 10:04:56,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:04:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:56,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 10:04:56,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 10:04:56,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:04:56,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:04:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:04:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:04:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:04:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:04:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_40_0 [2025-02-08 10:04:56,205 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_40_0 [2025-02-08 10:04:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:04:56,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:04:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:04:56,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:04:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:04:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:04:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:04:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:04:56,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:04:56,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:04:56,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:04:56,293 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:04:56,295 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:04:56,578 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#z~0#1.base, main_~#z~0#1.offset);havoc main_~#z~0#1.base, main_~#z~0#1.offset; [2025-02-08 10:04:56,607 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-02-08 10:04:56,608 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:04:56,618 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:04:56,620 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:04:56,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:56 BoogieIcfgContainer [2025-02-08 10:04:56,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:04:56,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:04:56,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:04:56,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:04:56,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:04:55" (1/3) ... [2025-02-08 10:04:56,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77aa36b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:04:56, skipping insertion in model container [2025-02-08 10:04:56,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:56" (2/3) ... [2025-02-08 10:04:56,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77aa36b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:04:56, skipping insertion in model container [2025-02-08 10:04:56,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:56" (3/3) ... [2025-02-08 10:04:56,631 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_prodbin-ll.c [2025-02-08 10:04:56,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:04:56,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_prodbin-ll.c that has 3 procedures, 56 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-08 10:04:56,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:04:56,707 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;@44f3e62f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:04:56,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 10:04:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 50 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 10:04:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:04:56,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:56,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:56,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:04:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1500395129, now seen corresponding path program 1 times [2025-02-08 10:04:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282440432] [2025-02-08 10:04:56,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:56,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:04:56,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:04:56,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:56,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282440432] [2025-02-08 10:04:56,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282440432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:56,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:56,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:04:56,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980572679] [2025-02-08 10:04:56,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:56,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 10:04:56,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:56,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 10:04:56,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:04:56,926 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 50 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:56,941 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2025-02-08 10:04:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 10:04:56,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 10:04:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:56,948 INFO L225 Difference]: With dead ends: 110 [2025-02-08 10:04:56,948 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 10:04:56,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:04:56,953 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:56,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:04:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 10:04:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 10:04:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 10:04:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-02-08 10:04:56,982 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 7 [2025-02-08 10:04:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:56,982 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-02-08 10:04:56,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-02-08 10:04:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:04:56,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:56,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:56,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:04:56,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:04:56,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1529024280, now seen corresponding path program 1 times [2025-02-08 10:04:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268814055] [2025-02-08 10:04:56,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:57,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:04:57,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:04:57,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:57,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1750020463] [2025-02-08 10:04:57,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:57,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:57,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:57,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:57,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 10:04:57,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:04:57,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:04:57,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:57,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:57,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 10:04:57,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:57,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:57,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:57,369 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 25 treesize of output 17 [2025-02-08 10:04:57,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:57,383 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 30 treesize of output 18 [2025-02-08 10:04:57,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:57,500 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 22 treesize of output 10 [2025-02-08 10:04:57,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 10:04:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:57,527 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:57,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:57,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268814055] [2025-02-08 10:04:57,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:57,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750020463] [2025-02-08 10:04:57,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750020463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:57,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:57,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766807524] [2025-02-08 10:04:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:57,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:04:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:57,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:04:57,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:04:57,530 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:57,792 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-02-08 10:04:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:57,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 10:04:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:57,793 INFO L225 Difference]: With dead ends: 89 [2025-02-08 10:04:57,794 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 10:04:57,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 10:04:57,795 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:57,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 228 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:04:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 10:04:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 64. [2025-02-08 10:04:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 57 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:04:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-02-08 10:04:57,811 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 7 [2025-02-08 10:04:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:57,811 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-02-08 10:04:57,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-02-08 10:04:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 10:04:57,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:57,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:57,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 10:04:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:58,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_0_to_40_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:04:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash 155112428, now seen corresponding path program 1 times [2025-02-08 10:04:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406620249] [2025-02-08 10:04:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:58,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 10:04:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 10:04:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:58,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714767264] [2025-02-08 10:04:58,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:58,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:58,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:58,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:58,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 10:04:58,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 10:04:58,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 10:04:58,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:58,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:58,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 10:04:58,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:58,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:58,271 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 30 treesize of output 18 [2025-02-08 10:04:58,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:58,286 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 19 treesize of output 11 [2025-02-08 10:04:58,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:58,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 10:04:58,375 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 22 treesize of output 10 [2025-02-08 10:04:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:58,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:58,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406620249] [2025-02-08 10:04:58,398 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714767264] [2025-02-08 10:04:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714767264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:58,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305932936] [2025-02-08 10:04:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:04:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:58,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:04:58,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:04:58,399 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:58,637 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2025-02-08 10:04:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:58,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 10:04:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:58,638 INFO L225 Difference]: With dead ends: 88 [2025-02-08 10:04:58,638 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 10:04:58,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 10:04:58,639 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 69 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:58,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 232 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:04:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 10:04:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2025-02-08 10:04:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 10:04:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-02-08 10:04:58,650 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 8 [2025-02-08 10:04:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:58,650 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-02-08 10:04:58,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-02-08 10:04:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 10:04:58,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:58,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:58,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 10:04:58,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:58,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_0_to_40_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:04:58,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash 513517974, now seen corresponding path program 1 times [2025-02-08 10:04:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:58,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246395238] [2025-02-08 10:04:58,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:58,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 10:04:58,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 10:04:58,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:58,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:59,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246395238] [2025-02-08 10:04:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246395238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:59,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:59,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516559731] [2025-02-08 10:04:59,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:59,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:59,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:59,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:59,181 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:59,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:59,317 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2025-02-08 10:04:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:04:59,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 10:04:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:59,320 INFO L225 Difference]: With dead ends: 101 [2025-02-08 10:04:59,321 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 10:04:59,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:04:59,324 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 76 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:59,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 202 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 10:04:59,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2025-02-08 10:04:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 76 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-08 10:04:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2025-02-08 10:04:59,339 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 9 [2025-02-08 10:04:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:59,339 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2025-02-08 10:04:59,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2025-02-08 10:04:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 10:04:59,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:59,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:59,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:04:59,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_0_to_40_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:04:59,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1260811990, now seen corresponding path program 1 times [2025-02-08 10:04:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:59,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733113011] [2025-02-08 10:04:59,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:59,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 10:04:59,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 10:04:59,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:59,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733113011] [2025-02-08 10:04:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733113011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:59,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:59,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427855262] [2025-02-08 10:04:59,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:59,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:59,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:59,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:59,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:59,574 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:59,755 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2025-02-08 10:04:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:04:59,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 10:04:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:59,757 INFO L225 Difference]: With dead ends: 100 [2025-02-08 10:04:59,757 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 10:04:59,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:04:59,758 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 67 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:59,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 244 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 10:04:59,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2025-02-08 10:04:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 76 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-08 10:04:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2025-02-08 10:04:59,767 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 10 [2025-02-08 10:04:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:59,767 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2025-02-08 10:04:59,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:04:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2025-02-08 10:04:59,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 10:04:59,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:59,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:59,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 10:04:59,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_0_to_40_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:04:59,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:59,768 INFO L85 PathProgramCache]: Analyzing trace with hash -430466028, now seen corresponding path program 1 times [2025-02-08 10:04:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358920755] [2025-02-08 10:04:59,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:59,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 10:04:59,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 10:04:59,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:59,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458993580] [2025-02-08 10:04:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:59,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:59,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:59,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:59,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 10:04:59,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 10:04:59,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 10:04:59,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:59,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:59,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 10:04:59,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:59,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:59,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:59,904 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 11 [2025-02-08 10:04:59,910 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 11 [2025-02-08 10:04:59,957 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 19 treesize of output 11 [2025-02-08 10:04:59,963 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 19 treesize of output 11 [2025-02-08 10:05:00,008 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 23 treesize of output 15 [2025-02-08 10:05:00,013 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 19 treesize of output 11 [2025-02-08 10:05:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:00,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:00,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:00,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358920755] [2025-02-08 10:05:00,027 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:00,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458993580] [2025-02-08 10:05:00,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458993580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:00,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:00,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:00,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215826669] [2025-02-08 10:05:00,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:00,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:05:00,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:00,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:05:00,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:00,029 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:00,293 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2025-02-08 10:05:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 10:05:00,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 10:05:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:00,294 INFO L225 Difference]: With dead ends: 120 [2025-02-08 10:05:00,294 INFO L226 Difference]: Without dead ends: 119 [2025-02-08 10:05:00,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-08 10:05:00,295 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 94 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:00,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 228 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-08 10:05:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2025-02-08 10:05:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 93 states have internal predecessors, (116), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-08 10:05:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2025-02-08 10:05:00,313 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 11 [2025-02-08 10:05:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:00,313 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2025-02-08 10:05:00,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2025-02-08 10:05:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 10:05:00,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:00,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:00,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:00,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:00,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_0_to_40_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:00,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash -459544984, now seen corresponding path program 1 times [2025-02-08 10:05:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:00,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018745694] [2025-02-08 10:05:00,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:00,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 10:05:00,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 10:05:00,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:00,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1725607706] [2025-02-08 10:05:00,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:00,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:00,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:00,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 10:05:00,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 10:05:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 10:05:00,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:00,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:00,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 10:05:00,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:00,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:05:00,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:05:00,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:05:00,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:05:00,754 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 19 treesize of output 11 [2025-02-08 10:05:00,760 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 19 treesize of output 11 [2025-02-08 10:05:00,870 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 22 treesize of output 10 [2025-02-08 10:05:00,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 10:05:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:00,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:00,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018745694] [2025-02-08 10:05:00,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725607706] [2025-02-08 10:05:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725607706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 10:05:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735788698] [2025-02-08 10:05:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:00,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 10:05:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:00,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 10:05:00,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:00,925 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. Second operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:01,357 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2025-02-08 10:05:01,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:05:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 10:05:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:01,359 INFO L225 Difference]: With dead ends: 117 [2025-02-08 10:05:01,359 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 10:05:01,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-08 10:05:01,360 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 87 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:01,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 258 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 10:05:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2025-02-08 10:05:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.554054054054054) internal successors, (115), 93 states have internal predecessors, (115), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-08 10:05:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2025-02-08 10:05:01,378 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 12 [2025-02-08 10:05:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:01,378 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2025-02-08 10:05:01,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2025-02-08 10:05:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 10:05:01,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:01,382 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] [2025-02-08 10:05:01,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 10:05:01,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 10:05:01,583 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_0_to_40_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:01,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1704730906, now seen corresponding path program 1 times [2025-02-08 10:05:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:01,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315423062] [2025-02-08 10:05:01,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:01,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 10:05:01,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 10:05:01,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:01,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315423062] [2025-02-08 10:05:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315423062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:01,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:01,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305387998] [2025-02-08 10:05:01,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:01,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:01,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:01,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:01,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:01,967 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:02,084 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2025-02-08 10:05:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:02,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 10:05:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:02,086 INFO L225 Difference]: With dead ends: 110 [2025-02-08 10:05:02,086 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 10:05:02,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:02,087 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:02,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 242 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 10:05:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2025-02-08 10:05:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 93 states have internal predecessors, (114), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-08 10:05:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2025-02-08 10:05:02,104 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 21 [2025-02-08 10:05:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:02,104 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2025-02-08 10:05:02,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2025-02-08 10:05:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 10:05:02,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:02,105 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] [2025-02-08 10:05:02,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 10:05:02,105 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_0_to_40_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:02,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:02,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1307050518, now seen corresponding path program 1 times [2025-02-08 10:05:02,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:02,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653939911] [2025-02-08 10:05:02,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:02,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 10:05:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 10:05:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:02,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653939911] [2025-02-08 10:05:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653939911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:02,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130634129] [2025-02-08 10:05:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:02,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:02,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:02,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:02,460 INFO L87 Difference]: Start difference. First operand 103 states and 134 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:02,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:02,563 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2025-02-08 10:05:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-08 10:05:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:02,565 INFO L225 Difference]: With dead ends: 109 [2025-02-08 10:05:02,565 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 10:05:02,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:02,565 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:02,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 245 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 10:05:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2025-02-08 10:05:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.527027027027027) internal successors, (113), 93 states have internal predecessors, (113), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-08 10:05:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2025-02-08 10:05:02,575 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 22 [2025-02-08 10:05:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:02,576 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2025-02-08 10:05:02,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2025-02-08 10:05:02,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 10:05:02,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:02,577 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] [2025-02-08 10:05:02,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 10:05:02,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_0_to_40_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:02,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:02,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1307051255, now seen corresponding path program 1 times [2025-02-08 10:05:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398274069] [2025-02-08 10:05:02,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:02,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 10:05:02,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 10:05:02,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:02,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:02,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:02,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398274069] [2025-02-08 10:05:02,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398274069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:02,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:02,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:02,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462149726] [2025-02-08 10:05:02,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:02,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:02,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:02,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:02,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:02,779 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:02,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:02,873 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2025-02-08 10:05:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:02,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-02-08 10:05:02,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:02,874 INFO L225 Difference]: With dead ends: 114 [2025-02-08 10:05:02,875 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 10:05:02,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:02,876 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:02,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 248 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 10:05:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2025-02-08 10:05:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5) internal successors, (111), 93 states have internal predecessors, (111), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-08 10:05:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2025-02-08 10:05:02,885 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 22 [2025-02-08 10:05:02,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:02,886 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2025-02-08 10:05:02,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2025-02-08 10:05:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 10:05:02,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:02,887 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] [2025-02-08 10:05:02,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 10:05:02,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1862750644, now seen corresponding path program 1 times [2025-02-08 10:05:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076479669] [2025-02-08 10:05:02,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:02,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:05:02,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:05:02,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:02,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076479669] [2025-02-08 10:05:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076479669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:03,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:03,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:05:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890863561] [2025-02-08 10:05:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:03,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:05:03,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:03,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:05:03,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:03,097 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:03,226 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2025-02-08 10:05:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:03,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-02-08 10:05:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:03,229 INFO L225 Difference]: With dead ends: 121 [2025-02-08 10:05:03,229 INFO L226 Difference]: Without dead ends: 114 [2025-02-08 10:05:03,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:05:03,230 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:03,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 182 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-08 10:05:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2025-02-08 10:05:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.48) internal successors, (111), 93 states have internal predecessors, (111), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:05:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2025-02-08 10:05:03,244 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 23 [2025-02-08 10:05:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:03,244 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2025-02-08 10:05:03,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2025-02-08 10:05:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 10:05:03,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:03,245 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] [2025-02-08 10:05:03,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:05:03,245 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_0_to_40_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:03,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1863860376, now seen corresponding path program 1 times [2025-02-08 10:05:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817042213] [2025-02-08 10:05:03,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:03,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:05:03,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:05:03,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:03,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:03,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817042213] [2025-02-08 10:05:03,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817042213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:03,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:03,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:03,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028485753] [2025-02-08 10:05:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:03,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:03,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:03,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:03,436 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:03,534 INFO L93 Difference]: Finished difference Result 110 states and 133 transitions. [2025-02-08 10:05:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:03,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-08 10:05:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:03,535 INFO L225 Difference]: With dead ends: 110 [2025-02-08 10:05:03,535 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 10:05:03,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:03,536 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:03,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 234 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 10:05:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2025-02-08 10:05:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 93 states have internal predecessors, (110), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:05:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2025-02-08 10:05:03,547 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 23 [2025-02-08 10:05:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:03,548 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2025-02-08 10:05:03,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2025-02-08 10:05:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 10:05:03,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:03,549 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] [2025-02-08 10:05:03,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:05:03,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_0_to_40_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:03,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1863883216, now seen corresponding path program 1 times [2025-02-08 10:05:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215689935] [2025-02-08 10:05:03,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:03,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:05:03,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:05:03,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:03,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215689935] [2025-02-08 10:05:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215689935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116860660] [2025-02-08 10:05:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:03,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:03,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:03,747 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:03,829 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2025-02-08 10:05:03,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:03,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-02-08 10:05:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:03,831 INFO L225 Difference]: With dead ends: 107 [2025-02-08 10:05:03,831 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 10:05:03,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:03,831 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:03,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 255 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 10:05:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-08 10:05:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.44) internal successors, (108), 93 states have internal predecessors, (108), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:05:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2025-02-08 10:05:03,845 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 23 [2025-02-08 10:05:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:03,845 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2025-02-08 10:05:03,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2025-02-08 10:05:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 10:05:03,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:03,847 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] [2025-02-08 10:05:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 10:05:03,847 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_0_to_40_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1945096788, now seen corresponding path program 1 times [2025-02-08 10:05:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599251555] [2025-02-08 10:05:03,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:03,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 10:05:03,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 10:05:03,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:03,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599251555] [2025-02-08 10:05:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599251555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896698431] [2025-02-08 10:05:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:04,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:04,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:04,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:04,037 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:04,135 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2025-02-08 10:05:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-08 10:05:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:04,137 INFO L225 Difference]: With dead ends: 108 [2025-02-08 10:05:04,137 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 10:05:04,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:04,138 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:04,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 237 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 10:05:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-02-08 10:05:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 93 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:05:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2025-02-08 10:05:04,148 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 24 [2025-02-08 10:05:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:04,149 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2025-02-08 10:05:04,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2025-02-08 10:05:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 10:05:04,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:04,152 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] [2025-02-08 10:05:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 10:05:04,152 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:04,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1945804821, now seen corresponding path program 1 times [2025-02-08 10:05:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114678705] [2025-02-08 10:05:04,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:04,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:04,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 10:05:04,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 10:05:04,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:04,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:04,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:04,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114678705] [2025-02-08 10:05:04,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114678705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:04,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:04,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728511659] [2025-02-08 10:05:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:04,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:04,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:04,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:04,358 INFO L87 Difference]: Start difference. First operand 105 states and 129 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:04,475 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2025-02-08 10:05:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-02-08 10:05:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:04,476 INFO L225 Difference]: With dead ends: 123 [2025-02-08 10:05:04,477 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 10:05:04,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:04,477 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 54 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:04,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 265 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 10:05:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2025-02-08 10:05:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.4) internal successors, (105), 93 states have internal predecessors, (105), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:05:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2025-02-08 10:05:04,486 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 24 [2025-02-08 10:05:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:04,486 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2025-02-08 10:05:04,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2025-02-08 10:05:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 10:05:04,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:04,487 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] [2025-02-08 10:05:04,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 10:05:04,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:04,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash 190407278, now seen corresponding path program 1 times [2025-02-08 10:05:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:04,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556070592] [2025-02-08 10:05:04,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:04,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 10:05:04,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 10:05:04,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:04,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556070592] [2025-02-08 10:05:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556070592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395581036] [2025-02-08 10:05:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:05:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:04,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:05:04,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:04,690 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:04,803 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2025-02-08 10:05:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-08 10:05:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:04,804 INFO L225 Difference]: With dead ends: 122 [2025-02-08 10:05:04,804 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 10:05:04,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 10:05:04,805 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:04,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 268 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 10:05:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2025-02-08 10:05:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 93 states have internal predecessors, (103), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:05:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2025-02-08 10:05:04,814 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 25 [2025-02-08 10:05:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:04,814 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2025-02-08 10:05:04,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2025-02-08 10:05:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:05:04,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:04,815 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] [2025-02-08 10:05:04,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 10:05:04,815 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:04,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:04,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2018288400, now seen corresponding path program 1 times [2025-02-08 10:05:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:04,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122905019] [2025-02-08 10:05:04,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:04,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:04,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:05:04,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:05:04,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:04,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122905019] [2025-02-08 10:05:05,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122905019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:05,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:05,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 10:05:05,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136965051] [2025-02-08 10:05:05,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:05,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:05:05,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:05,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:05:05,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:05,076 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:05,234 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2025-02-08 10:05:05,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 10:05:05,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-02-08 10:05:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:05,236 INFO L225 Difference]: With dead ends: 118 [2025-02-08 10:05:05,237 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 10:05:05,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-08 10:05:05,237 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 82 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:05,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 192 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 10:05:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2025-02-08 10:05:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 91 states have internal predecessors, (100), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:05:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2025-02-08 10:05:05,249 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 28 [2025-02-08 10:05:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:05,249 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2025-02-08 10:05:05,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2025-02-08 10:05:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:05:05,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:05,250 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 10:05:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 10:05:05,250 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:05:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash 569716182, now seen corresponding path program 1 times [2025-02-08 10:05:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360940784] [2025-02-08 10:05:05,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:05,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:05,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:05,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610172342] [2025-02-08 10:05:05,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:05,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:05,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:05,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 10:05:05,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:05:05,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:05:05,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:05,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:05,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-08 10:05:05,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:05,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:05:05,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:05:05,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:05:05,487 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 21 treesize of output 13 [2025-02-08 10:05:05,496 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 30 treesize of output 18 [2025-02-08 10:05:05,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:05:05,973 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 15 [2025-02-08 10:05:06,063 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 42 treesize of output 22 [2025-02-08 10:05:06,183 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 22 treesize of output 10 [2025-02-08 10:05:06,189 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 28 treesize of output 16 [2025-02-08 10:05:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:06,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:05:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360940784] [2025-02-08 10:05:07,508 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610172342] [2025-02-08 10:05:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610172342] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:05:07,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 10:05:07,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 29 [2025-02-08 10:05:07,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79670777] [2025-02-08 10:05:07,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 10:05:07,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 10:05:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:07,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 10:05:07,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-02-08 10:05:07,511 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:12,147 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-02-08 10:05:16,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 10:05:20,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:05:24,424 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-02-08 10:05:28,616 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-02-08 10:05:33,228 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-02-08 10:05:37,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:05:41,414 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-02-08 10:05:45,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:05:49,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:05:53,740 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-02-08 10:05:57,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:06:01,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:06:05,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 10:06:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:05,790 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2025-02-08 10:06:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 10:06:05,793 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-02-08 10:06:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:05,794 INFO L225 Difference]: With dead ends: 151 [2025-02-08 10:06:05,794 INFO L226 Difference]: Without dead ends: 150 [2025-02-08 10:06:05,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=292, Invalid=1600, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 10:06:05,795 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 242 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 28 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.5s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:05,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 414 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 702 Invalid, 14 Unknown, 0 Unchecked, 57.5s Time] [2025-02-08 10:06:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-08 10:06:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2025-02-08 10:06:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 105 states have internal predecessors, (117), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (15), 8 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-08 10:06:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2025-02-08 10:06:05,811 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 29 [2025-02-08 10:06:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:05,812 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2025-02-08 10:06:05,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:06:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2025-02-08 10:06:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:06:05,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:05,813 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] [2025-02-08 10:06:05,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 10:06:06,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 10:06:06,017 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:06,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1857569069, now seen corresponding path program 1 times [2025-02-08 10:06:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238899713] [2025-02-08 10:06:06,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:06,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:06:06,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:06:06,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:06,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:06:06,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:06,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238899713] [2025-02-08 10:06:06,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238899713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:06:06,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:06:06,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:06:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273035872] [2025-02-08 10:06:06,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:06:06,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 10:06:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:06,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 10:06:06,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:06:06,360 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:06:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:06:06,596 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2025-02-08 10:06:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 10:06:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 10:06:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:06:06,599 INFO L225 Difference]: With dead ends: 131 [2025-02-08 10:06:06,602 INFO L226 Difference]: Without dead ends: 129 [2025-02-08 10:06:06,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-08 10:06:06,603 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 58 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:06:06,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 274 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:06:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-08 10:06:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2025-02-08 10:06:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 103 states have internal predecessors, (114), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (15), 8 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-08 10:06:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2025-02-08 10:06:06,617 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 29 [2025-02-08 10:06:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:06:06,617 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2025-02-08 10:06:06,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:06:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2025-02-08 10:06:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 10:06:06,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:06:06,619 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] [2025-02-08 10:06:06,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 10:06:06,619 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_0_to_40_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 10:06:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:06:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash 481332462, now seen corresponding path program 1 times [2025-02-08 10:06:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:06:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367454819] [2025-02-08 10:06:06,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:06:06,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:06:06,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:06:06,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:06,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:06:06,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689342523] [2025-02-08 10:06:06,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:06:06,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:06:06,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:06:06,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:06:06,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 10:06:06,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 10:06:06,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 10:06:06,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:06:06,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:06:06,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-08 10:06:06,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:06:06,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:06:06,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:06:06,875 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 23 treesize of output 15 [2025-02-08 10:06:06,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:06:06,892 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 30 treesize of output 18 [2025-02-08 10:06:06,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:06:07,291 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 25 treesize of output 13 [2025-02-08 10:06:07,400 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 42 treesize of output 22 [2025-02-08 10:06:07,551 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 22 treesize of output 10 [2025-02-08 10:06:07,560 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 26 treesize of output 14 [2025-02-08 10:06:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:06:07,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:06:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:06:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:06:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367454819] [2025-02-08 10:06:09,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:06:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689342523] [2025-02-08 10:06:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689342523] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:06:09,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 10:06:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2025-02-08 10:06:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372841427] [2025-02-08 10:06:09,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 10:06:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 10:06:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:06:09,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 10:06:09,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2025-02-08 10:06:09,483 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 27 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:06:14,308 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-02-08 10:06:18,376 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-02-08 10:06:22,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-08 10:06:26,558 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]