./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:34:08,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:34:08,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:34:08,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:34:08,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:34:09,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:34:09,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:34:09,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:34:09,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:34:09,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:34:09,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:34:09,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:34:09,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:34:09,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:34:09,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:34:09,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:34:09,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:34:09,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:34:09,026 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2025-02-06 14:34:09,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:34:09,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:34:09,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:34:09,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:34:09,272 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:34:09,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-02-06 14:34:10,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/603fda2f5/9a2d498259e84c30a40f609dd5e752ae/FLAGf91c8a563 [2025-02-06 14:34:10,792 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:34:10,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-02-06 14:34:10,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/603fda2f5/9a2d498259e84c30a40f609dd5e752ae/FLAGf91c8a563 [2025-02-06 14:34:10,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/603fda2f5/9a2d498259e84c30a40f609dd5e752ae [2025-02-06 14:34:10,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:34:10,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:34:10,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:34:10,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:34:10,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:34:10,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:10,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a56b02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10, skipping insertion in model container [2025-02-06 14:34:10,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:10,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:34:10,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:34:10,929 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:34:10,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:34:10,958 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:34:10,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10 WrapperNode [2025-02-06 14:34:10,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:34:10,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:34:10,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:34:10,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:34:10,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:10,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:10,984 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-02-06 14:34:10,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:34:10,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:34:10,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:34:10,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:34:10,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:10,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:10,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:11,015 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2025-02-06 14:34:11,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:11,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:11,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:11,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:11,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:11,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:11,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:34:11,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:34:11,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:34:11,032 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:34:11,032 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (1/1) ... [2025-02-06 14:34:11,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:34:11,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:11,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:34:11,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:34:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:34:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:34:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:34:11,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 14:34:11,085 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-02-06 14:34:11,086 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-02-06 14:34:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-02-06 14:34:11,086 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-02-06 14:34:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-02-06 14:34:11,086 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-02-06 14:34:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:34:11,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:34:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 14:34:11,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 14:34:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 14:34:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 14:34:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 14:34:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 14:34:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-02-06 14:34:11,087 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-02-06 14:34:11,087 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-02-06 14:34:11,088 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-02-06 14:34:11,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:34:11,171 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:34:11,172 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:34:11,313 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: 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_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset; [2025-02-06 14:34:11,330 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-06 14:34:11,331 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:34:11,338 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:34:11,338 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:34:11,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:11 BoogieIcfgContainer [2025-02-06 14:34:11,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:34:11,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:34:11,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:34:11,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:34:11,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:34:10" (1/3) ... [2025-02-06 14:34:11,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5742fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:34:11, skipping insertion in model container [2025-02-06 14:34:11,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:10" (2/3) ... [2025-02-06 14:34:11,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5742fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:34:11, skipping insertion in model container [2025-02-06 14:34:11,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:11" (3/3) ... [2025-02-06 14:34:11,345 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2025-02-06 14:34:11,357 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:34:11,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_5.c that has 6 procedures, 70 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-02-06 14:34:11,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:34:11,407 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;@f457685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:34:11,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 14:34:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 14:34:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:34:11,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:11,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:11,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:11,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash -833184271, now seen corresponding path program 1 times [2025-02-06 14:34:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030859997] [2025-02-06 14:34:11,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:11,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:34:11,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:34:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:11,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030859997] [2025-02-06 14:34:11,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030859997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:11,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486634214] [2025-02-06 14:34:11,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:11,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:11,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:11,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:11,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:11,852 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-06 14:34:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:12,049 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2025-02-06 14:34:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2025-02-06 14:34:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:12,055 INFO L225 Difference]: With dead ends: 140 [2025-02-06 14:34:12,055 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 14:34:12,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:12,059 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:12,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 158 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 14:34:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-06 14:34:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 45 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 14:34:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-02-06 14:34:12,082 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 12 [2025-02-06 14:34:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:12,083 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-02-06 14:34:12,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-06 14:34:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-02-06 14:34:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 14:34:12,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:12,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:12,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:34:12,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:12,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash -120203960, now seen corresponding path program 1 times [2025-02-06 14:34:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127961939] [2025-02-06 14:34:12,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:12,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 14:34:12,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 14:34:12,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:12,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127961939] [2025-02-06 14:34:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127961939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:12,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517399255] [2025-02-06 14:34:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:12,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:12,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:12,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:12,221 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:12,275 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2025-02-06 14:34:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:12,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-06 14:34:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:12,276 INFO L225 Difference]: With dead ends: 66 [2025-02-06 14:34:12,277 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 14:34:12,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:12,277 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:12,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 274 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 14:34:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-06 14:34:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 49 states have internal predecessors, (50), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-06 14:34:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-02-06 14:34:12,283 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 15 [2025-02-06 14:34:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-02-06 14:34:12,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-02-06 14:34:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 14:34:12,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:12,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:34:12,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:12,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 778329638, now seen corresponding path program 1 times [2025-02-06 14:34:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587390498] [2025-02-06 14:34:12,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:12,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 14:34:12,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 14:34:12,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:12,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:12,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-06 14:34:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:12,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587390498] [2025-02-06 14:34:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587390498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:12,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817225690] [2025-02-06 14:34:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:12,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:12,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:12,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:12,459 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:12,516 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2025-02-06 14:34:12,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:12,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 14:34:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:12,517 INFO L225 Difference]: With dead ends: 126 [2025-02-06 14:34:12,517 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 14:34:12,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:12,518 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:12,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 273 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 14:34:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-02-06 14:34:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-06 14:34:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-02-06 14:34:12,526 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 18 [2025-02-06 14:34:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:12,526 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-02-06 14:34:12,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-02-06 14:34:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 14:34:12,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:12,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:12,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:34:12,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:12,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:12,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1641585005, now seen corresponding path program 1 times [2025-02-06 14:34:12,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:12,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978063195] [2025-02-06 14:34:12,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:12,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:12,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 14:34:12,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 14:34:12,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:12,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978063195] [2025-02-06 14:34:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978063195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:12,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:12,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:34:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449786873] [2025-02-06 14:34:12,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:12,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:34:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:12,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:34:12,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:34:12,597 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:12,617 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-02-06 14:34:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:34:12,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 14:34:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:12,618 INFO L225 Difference]: With dead ends: 65 [2025-02-06 14:34:12,618 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 14:34:12,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:34:12,619 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:12,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 14:34:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-06 14:34:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 50 states have internal predecessors, (52), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-06 14:34:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-02-06 14:34:12,625 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 19 [2025-02-06 14:34:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:12,625 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-02-06 14:34:12,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-02-06 14:34:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 14:34:12,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:12,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:12,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:34:12,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:12,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash 777904524, now seen corresponding path program 1 times [2025-02-06 14:34:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598460586] [2025-02-06 14:34:12,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:12,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 14:34:12,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 14:34:12,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:12,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:12,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:12,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598460586] [2025-02-06 14:34:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598460586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:12,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:12,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104682548] [2025-02-06 14:34:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:12,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:12,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:12,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:12,837 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:12,920 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2025-02-06 14:34:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:12,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-02-06 14:34:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:12,922 INFO L225 Difference]: With dead ends: 133 [2025-02-06 14:34:12,922 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 14:34:12,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:34:12,923 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:12,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 261 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 14:34:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-02-06 14:34:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.302325581395349) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-06 14:34:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-02-06 14:34:12,933 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 18 [2025-02-06 14:34:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:12,933 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-02-06 14:34:12,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-02-06 14:34:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 14:34:12,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:12,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:12,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:34:12,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1654763550, now seen corresponding path program 1 times [2025-02-06 14:34:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761361674] [2025-02-06 14:34:12,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:12,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:12,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 14:34:12,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 14:34:12,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:12,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761361674] [2025-02-06 14:34:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761361674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:13,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:34:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996697431] [2025-02-06 14:34:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:34:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:13,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:34:13,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:34:13,017 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:13,052 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2025-02-06 14:34:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:34:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-02-06 14:34:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:13,053 INFO L225 Difference]: With dead ends: 69 [2025-02-06 14:34:13,053 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 14:34:13,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:13,054 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:13,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 206 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 14:34:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 14:34:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-02-06 14:34:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-02-06 14:34:13,059 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2025-02-06 14:34:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:13,059 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-02-06 14:34:13,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-02-06 14:34:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 14:34:13,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:13,060 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] [2025-02-06 14:34:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:34:13,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:13,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -667652870, now seen corresponding path program 1 times [2025-02-06 14:34:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:13,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370357809] [2025-02-06 14:34:13,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:13,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 14:34:13,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 14:34:13,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:13,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:13,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:13,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370357809] [2025-02-06 14:34:13,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370357809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:13,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:13,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:13,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174899648] [2025-02-06 14:34:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:13,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:13,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:13,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:13,207 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:13,276 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-02-06 14:34:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:13,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 14:34:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:13,277 INFO L225 Difference]: With dead ends: 74 [2025-02-06 14:34:13,279 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 14:34:13,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:34:13,280 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 11 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:13,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 211 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 14:34:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-02-06 14:34:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.255813953488372) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-06 14:34:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-02-06 14:34:13,290 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 23 [2025-02-06 14:34:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:13,291 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-02-06 14:34:13,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-02-06 14:34:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 14:34:13,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:13,292 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] [2025-02-06 14:34:13,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:34:13,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:13,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1589706898, now seen corresponding path program 1 times [2025-02-06 14:34:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:13,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888419354] [2025-02-06 14:34:13,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:13,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:13,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:34:13,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:34:13,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:13,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:34:13,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:13,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888419354] [2025-02-06 14:34:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888419354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:13,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:13,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025293047] [2025-02-06 14:34:13,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:13,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:13,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:13,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:13,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:13,424 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:34:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:13,488 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2025-02-06 14:34:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:13,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-06 14:34:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:13,489 INFO L225 Difference]: With dead ends: 85 [2025-02-06 14:34:13,489 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 14:34:13,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:13,490 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:13,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 251 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 14:34:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2025-02-06 14:34:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 57 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-06 14:34:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-02-06 14:34:13,496 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 28 [2025-02-06 14:34:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:13,496 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-02-06 14:34:13,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:34:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-02-06 14:34:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:34:13,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:13,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:13,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:34:13,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:13,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash -496755411, now seen corresponding path program 1 times [2025-02-06 14:34:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:13,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197102386] [2025-02-06 14:34:13,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:13,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:34:13,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:34:13,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:13,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:34:13,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197102386] [2025-02-06 14:34:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197102386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400700962] [2025-02-06 14:34:13,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:13,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:13,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:13,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:13,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:34:13,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:34:13,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:34:13,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:13,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:13,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 14:34:13,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:13,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:13,862 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 19 treesize of output 11 [2025-02-06 14:34:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:34:13,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:13,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400700962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:13,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:13,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2025-02-06 14:34:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243417518] [2025-02-06 14:34:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:13,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:13,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:13,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:34:13,915 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:34:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:14,021 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2025-02-06 14:34:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:14,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-06 14:34:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:14,023 INFO L225 Difference]: With dead ends: 153 [2025-02-06 14:34:14,023 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 14:34:14,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:34:14,026 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:14,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 171 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 14:34:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 14:34:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.22) internal successors, (61), 57 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-06 14:34:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2025-02-06 14:34:14,035 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 29 [2025-02-06 14:34:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:14,035 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2025-02-06 14:34:14,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:34:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2025-02-06 14:34:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 14:34:14,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:14,038 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:14,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:14,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:14,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:14,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1333861163, now seen corresponding path program 1 times [2025-02-06 14:34:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:14,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189648977] [2025-02-06 14:34:14,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:14,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 14:34:14,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 14:34:14,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:14,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:34:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189648977] [2025-02-06 14:34:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189648977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070314626] [2025-02-06 14:34:14,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:14,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:14,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:14,568 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:14,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:34:14,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 14:34:14,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 14:34:14,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:14,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:14,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 14:34:14,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:14,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:34:14,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 14:34:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 14:34:14,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070314626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:14,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:14,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-02-06 14:34:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447907504] [2025-02-06 14:34:14,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:14,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:14,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:14,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:14,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:14,874 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:34:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:14,998 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2025-02-06 14:34:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:14,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2025-02-06 14:34:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:14,999 INFO L225 Difference]: With dead ends: 81 [2025-02-06 14:34:15,000 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 14:34:15,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-02-06 14:34:15,000 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 58 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:15,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 174 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 14:34:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2025-02-06 14:34:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.2) internal successors, (60), 56 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-06 14:34:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-02-06 14:34:15,009 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 46 [2025-02-06 14:34:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:15,010 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-02-06 14:34:15,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 14:34:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-02-06 14:34:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 14:34:15,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:15,010 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:15,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 14:34:15,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:15,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:15,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1599976909, now seen corresponding path program 1 times [2025-02-06 14:34:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153446817] [2025-02-06 14:34:15,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:15,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 14:34:15,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 14:34:15,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 14:34:15,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153446817] [2025-02-06 14:34:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153446817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:15,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:34:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862338734] [2025-02-06 14:34:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:15,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:34:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:15,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:34:15,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:34:15,268 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:34:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:15,293 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-02-06 14:34:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:34:15,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-02-06 14:34:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:15,294 INFO L225 Difference]: With dead ends: 77 [2025-02-06 14:34:15,294 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 14:34:15,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:15,295 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:15,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 14:34:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-02-06 14:34:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-06 14:34:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-02-06 14:34:15,301 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 47 [2025-02-06 14:34:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:15,302 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-02-06 14:34:15,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:34:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-02-06 14:34:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 14:34:15,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:15,303 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:34:15,303 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash -641521523, now seen corresponding path program 1 times [2025-02-06 14:34:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:15,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011673295] [2025-02-06 14:34:15,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:15,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 14:34:15,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 14:34:15,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:15,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 14:34:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011673295] [2025-02-06 14:34:15,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011673295] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:15,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459535653] [2025-02-06 14:34:15,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:15,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:15,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:15,610 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:15,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:34:15,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 14:34:15,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 14:34:15,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:15,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:15,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 14:34:15,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:15,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:34:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-06 14:34:15,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 14:34:16,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459535653] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:16,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2025-02-06 14:34:16,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333659640] [2025-02-06 14:34:16,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:16,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:34:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:34:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:34:16,349 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 24 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-06 14:34:16,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:16,627 INFO L93 Difference]: Finished difference Result 145 states and 174 transitions. [2025-02-06 14:34:16,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 14:34:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Word has length 69 [2025-02-06 14:34:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:16,628 INFO L225 Difference]: With dead ends: 145 [2025-02-06 14:34:16,628 INFO L226 Difference]: Without dead ends: 76 [2025-02-06 14:34:16,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2025-02-06 14:34:16,629 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 52 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:16,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 349 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-06 14:34:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-06 14:34:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-02-06 14:34:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2025-02-06 14:34:16,643 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 69 [2025-02-06 14:34:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:16,644 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2025-02-06 14:34:16,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-06 14:34:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2025-02-06 14:34:16,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 14:34:16,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:16,645 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:16,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 14:34:16,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:16,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:16,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash -57395635, now seen corresponding path program 2 times [2025-02-06 14:34:16,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:16,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672881046] [2025-02-06 14:34:16,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:16,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:16,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-02-06 14:34:16,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 14:34:16,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:16,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-06 14:34:17,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:17,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672881046] [2025-02-06 14:34:17,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672881046] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:17,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109191501] [2025-02-06 14:34:17,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:17,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:17,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:17,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:34:17,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-02-06 14:34:17,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 14:34:17,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:17,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 14:34:17,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:17,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:34:17,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 14:34:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-02-06 14:34:17,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:17,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109191501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:17,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:17,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2025-02-06 14:34:17,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943841669] [2025-02-06 14:34:17,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:17,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:17,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:17,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:17,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:17,803 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 14:34:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:17,936 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2025-02-06 14:34:17,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:17,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 149 [2025-02-06 14:34:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:17,938 INFO L225 Difference]: With dead ends: 80 [2025-02-06 14:34:17,938 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 14:34:17,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-02-06 14:34:17,939 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 46 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:17,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 14:34:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2025-02-06 14:34:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-06 14:34:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2025-02-06 14:34:17,953 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 149 [2025-02-06 14:34:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:17,954 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2025-02-06 14:34:17,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 14:34:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2025-02-06 14:34:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 14:34:17,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:17,957 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:17,966 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-06 14:34:18,157 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,SelfDestructingSolverStorable12 [2025-02-06 14:34:18,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2056065492, now seen corresponding path program 1 times [2025-02-06 14:34:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084944076] [2025-02-06 14:34:18,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:18,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 14:34:18,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 14:34:18,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:18,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-06 14:34:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084944076] [2025-02-06 14:34:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084944076] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564084794] [2025-02-06 14:34:18,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:18,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:18,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:18,494 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:18,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:34:18,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 14:34:18,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 14:34:18,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:18,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:18,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 14:34:18,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:18,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 14:34:18,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564084794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:18,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-02-06 14:34:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792013404] [2025-02-06 14:34:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:18,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:18,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:18,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:18,939 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 14:34:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:19,020 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2025-02-06 14:34:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:19,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2025-02-06 14:34:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:19,023 INFO L225 Difference]: With dead ends: 140 [2025-02-06 14:34:19,023 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 14:34:19,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-06 14:34:19,023 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:19,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 254 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:19,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 14:34:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2025-02-06 14:34:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 94 states have internal predecessors, (105), 20 states have call successors, (20), 18 states have call predecessors, (20), 20 states have return successors, (30), 22 states have call predecessors, (30), 18 states have call successors, (30) [2025-02-06 14:34:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2025-02-06 14:34:19,037 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 98 [2025-02-06 14:34:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:19,037 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2025-02-06 14:34:19,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 14:34:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2025-02-06 14:34:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 14:34:19,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:19,038 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:19,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:19,238 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,SelfDestructingSolverStorable13 [2025-02-06 14:34:19,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:19,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash -686479175, now seen corresponding path program 1 times [2025-02-06 14:34:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:19,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292027645] [2025-02-06 14:34:19,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:19,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 14:34:19,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 14:34:19,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:19,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-06 14:34:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292027645] [2025-02-06 14:34:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292027645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436288623] [2025-02-06 14:34:19,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:19,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:19,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:19,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:19,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:34:19,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 14:34:19,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 14:34:19,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:19,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:19,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:34:19,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:20,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:34:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 14:34:20,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436288623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:20,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:20,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-02-06 14:34:20,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658748317] [2025-02-06 14:34:20,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:20,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:20,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:20,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:20,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 14:34:20,154 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 14:34:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:20,232 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2025-02-06 14:34:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:20,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-02-06 14:34:20,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:20,234 INFO L225 Difference]: With dead ends: 135 [2025-02-06 14:34:20,234 INFO L226 Difference]: Without dead ends: 134 [2025-02-06 14:34:20,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:34:20,234 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:20,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:34:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-06 14:34:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-06 14:34:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 93 states have internal predecessors, (104), 20 states have call successors, (20), 18 states have call predecessors, (20), 20 states have return successors, (30), 22 states have call predecessors, (30), 18 states have call successors, (30) [2025-02-06 14:34:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2025-02-06 14:34:20,258 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 99 [2025-02-06 14:34:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:20,259 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2025-02-06 14:34:20,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 14:34:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2025-02-06 14:34:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 14:34:20,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:20,260 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:20,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 14:34:20,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 14:34:20,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:20,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash -469412426, now seen corresponding path program 1 times [2025-02-06 14:34:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:20,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373624747] [2025-02-06 14:34:20,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:20,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 14:34:20,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 14:34:20,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:20,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2025-02-06 14:34:20,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:20,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373624747] [2025-02-06 14:34:20,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373624747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:20,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197131973] [2025-02-06 14:34:20,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:20,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:20,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:20,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:20,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 14:34:20,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-06 14:34:21,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 14:34:21,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:21,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:21,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 14:34:21,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:21,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:34:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 130 proven. 15 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-02-06 14:34:21,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 122 proven. 39 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-02-06 14:34:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197131973] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:22,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 21] total 39 [2025-02-06 14:34:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101383052] [2025-02-06 14:34:22,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:22,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-06 14:34:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:22,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-06 14:34:22,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 14:34:22,703 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 39 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 33 states have internal predecessors, (85), 15 states have call successors, (26), 8 states have call predecessors, (26), 12 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2025-02-06 14:34:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:23,431 INFO L93 Difference]: Finished difference Result 267 states and 321 transitions. [2025-02-06 14:34:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 14:34:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 33 states have internal predecessors, (85), 15 states have call successors, (26), 8 states have call predecessors, (26), 12 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) Word has length 172 [2025-02-06 14:34:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:23,434 INFO L225 Difference]: With dead ends: 267 [2025-02-06 14:34:23,434 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 14:34:23,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=442, Invalid=2420, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 14:34:23,437 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 83 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:23,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 387 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 14:34:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 14:34:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-06 14:34:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 97 states have internal predecessors, (108), 20 states have call successors, (20), 18 states have call predecessors, (20), 24 states have return successors, (34), 26 states have call predecessors, (34), 18 states have call successors, (34) [2025-02-06 14:34:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2025-02-06 14:34:23,457 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 172 [2025-02-06 14:34:23,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:23,457 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2025-02-06 14:34:23,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 33 states have internal predecessors, (85), 15 states have call successors, (26), 8 states have call predecessors, (26), 12 states have return successors, (25), 14 states have call predecessors, (25), 15 states have call successors, (25) [2025-02-06 14:34:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2025-02-06 14:34:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-06 14:34:23,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:23,462 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 20, 20, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:23,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:23,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:23,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:23,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash 97931446, now seen corresponding path program 2 times [2025-02-06 14:34:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:23,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143456579] [2025-02-06 14:34:23,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:23,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:23,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-02-06 14:34:23,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-02-06 14:34:23,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:23,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:24,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3799 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3794 trivial. 0 not checked. [2025-02-06 14:34:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143456579] [2025-02-06 14:34:24,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143456579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699493737] [2025-02-06 14:34:24,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:24,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:24,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:24,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:24,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 14:34:24,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-02-06 14:34:24,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-02-06 14:34:24,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:24,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:24,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 14:34:24,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:24,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:34:25,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 14:34:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3799 backedges. 1997 proven. 0 refuted. 0 times theorem prover too weak. 1802 trivial. 0 not checked. [2025-02-06 14:34:25,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:25,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699493737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:25,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:25,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2025-02-06 14:34:25,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878936487] [2025-02-06 14:34:25,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:25,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:25,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:25,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:25,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:25,079 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 14:34:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:25,183 INFO L93 Difference]: Finished difference Result 148 states and 176 transitions. [2025-02-06 14:34:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:25,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 398 [2025-02-06 14:34:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:25,185 INFO L225 Difference]: With dead ends: 148 [2025-02-06 14:34:25,185 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 14:34:25,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-02-06 14:34:25,186 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:25,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 159 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 14:34:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2025-02-06 14:34:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 96 states have internal predecessors, (106), 20 states have call successors, (20), 18 states have call predecessors, (20), 24 states have return successors, (34), 26 states have call predecessors, (34), 18 states have call successors, (34) [2025-02-06 14:34:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2025-02-06 14:34:25,203 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 398 [2025-02-06 14:34:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:25,204 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2025-02-06 14:34:25,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 14:34:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2025-02-06 14:34:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-02-06 14:34:25,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:25,207 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 20, 20, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:25,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:25,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 14:34:25,411 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:25,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1259092499, now seen corresponding path program 1 times [2025-02-06 14:34:25,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:25,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964688493] [2025-02-06 14:34:25,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:25,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-02-06 14:34:25,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-02-06 14:34:25,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:25,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3794 trivial. 0 not checked. [2025-02-06 14:34:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964688493] [2025-02-06 14:34:26,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964688493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:26,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394371868] [2025-02-06 14:34:26,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:26,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:26,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:26,051 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:26,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 14:34:26,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-02-06 14:34:26,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-02-06 14:34:26,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:26,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:26,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 1808 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 14:34:26,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:26,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:34:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 1997 proven. 0 refuted. 0 times theorem prover too weak. 1803 trivial. 0 not checked. [2025-02-06 14:34:26,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:26,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394371868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:26,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:26,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-06 14:34:26,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793627968] [2025-02-06 14:34:26,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:26,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:26,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:26,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:26,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:34:26,732 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 14:34:30,803 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-06 14:34:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:30,821 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2025-02-06 14:34:30,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:30,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 399 [2025-02-06 14:34:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:30,825 INFO L225 Difference]: With dead ends: 141 [2025-02-06 14:34:30,825 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 14:34:30,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 395 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:30,825 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:30,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 14:34:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 14:34:30,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2025-02-06 14:34:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 89 states have (on average 1.101123595505618) internal successors, (98), 89 states have internal predecessors, (98), 18 states have call successors, (18), 18 states have call predecessors, (18), 24 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) [2025-02-06 14:34:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 148 transitions. [2025-02-06 14:34:30,847 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 148 transitions. Word has length 399 [2025-02-06 14:34:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:30,849 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 148 transitions. [2025-02-06 14:34:30,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 14:34:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2025-02-06 14:34:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-02-06 14:34:30,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:30,853 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 20, 20, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:30,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 14:34:31,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 14:34:31,054 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:31,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:31,055 INFO L85 PathProgramCache]: Analyzing trace with hash -876339540, now seen corresponding path program 1 times [2025-02-06 14:34:31,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:31,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469297676] [2025-02-06 14:34:31,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:31,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-02-06 14:34:31,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-02-06 14:34:31,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:31,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3801 trivial. 0 not checked. [2025-02-06 14:34:31,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:31,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469297676] [2025-02-06 14:34:31,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469297676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:31,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958280029] [2025-02-06 14:34:31,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:31,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:31,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:31,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:31,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 14:34:31,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-02-06 14:34:32,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-02-06 14:34:32,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:32,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:32,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1974 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 14:34:32,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:32,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 2097 proven. 3 refuted. 0 times theorem prover too weak. 1728 trivial. 0 not checked. [2025-02-06 14:34:32,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 298 proven. 172 refuted. 0 times theorem prover too weak. 3358 trivial. 0 not checked. [2025-02-06 14:34:33,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958280029] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:33,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:33,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-02-06 14:34:33,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100114242] [2025-02-06 14:34:33,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:33,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 14:34:33,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:33,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 14:34:33,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-02-06 14:34:33,554 INFO L87 Difference]: Start difference. First operand 132 states and 148 transitions. Second operand has 27 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 9 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (29), 6 states have call predecessors, (29), 9 states have call successors, (29) [2025-02-06 14:34:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:34,081 INFO L93 Difference]: Finished difference Result 264 states and 319 transitions. [2025-02-06 14:34:34,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 14:34:34,082 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 9 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (29), 6 states have call predecessors, (29), 9 states have call successors, (29) Word has length 421 [2025-02-06 14:34:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:34,083 INFO L225 Difference]: With dead ends: 264 [2025-02-06 14:34:34,083 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 14:34:34,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 826 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 14:34:34,085 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 80 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:34,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 132 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:34:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 14:34:34,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-06 14:34:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.096774193548387) internal successors, (102), 93 states have internal predecessors, (102), 18 states have call successors, (18), 18 states have call predecessors, (18), 28 states have return successors, (36), 28 states have call predecessors, (36), 16 states have call successors, (36) [2025-02-06 14:34:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2025-02-06 14:34:34,103 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 421 [2025-02-06 14:34:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:34,103 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2025-02-06 14:34:34,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 4.476190476190476) internal successors, (94), 23 states have internal predecessors, (94), 9 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (29), 6 states have call predecessors, (29), 9 states have call successors, (29) [2025-02-06 14:34:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2025-02-06 14:34:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2025-02-06 14:34:34,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:34,111 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 64, 64, 64, 64, 64, 40, 40, 32, 32, 32, 32, 32, 32, 32, 32, 32, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:34,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 14:34:34,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:34,312 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-02-06 14:34:34,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1857321328, now seen corresponding path program 2 times [2025-02-06 14:34:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:34,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43608558] [2025-02-06 14:34:34,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:34,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1043 statements into 2 equivalence classes. [2025-02-06 14:34:34,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1043 of 1043 statements. [2025-02-06 14:34:34,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:34,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30387 backedges. 10 proven. 197 refuted. 0 times theorem prover too weak. 30180 trivial. 0 not checked. [2025-02-06 14:34:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43608558] [2025-02-06 14:34:36,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43608558] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984594480] [2025-02-06 14:34:36,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:34:36,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:36,996 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:37,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 14:34:37,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1043 statements into 2 equivalence classes. [2025-02-06 14:34:37,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1043 of 1043 statements. [2025-02-06 14:34:37,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:34:37,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:37,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 4382 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 14:34:37,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:37,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:34:38,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 14:34:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 30387 backedges. 15453 proven. 0 refuted. 0 times theorem prover too weak. 14934 trivial. 0 not checked. [2025-02-06 14:34:38,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:38,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984594480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:38,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:38,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2025-02-06 14:34:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216072359] [2025-02-06 14:34:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:38,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:38,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:38,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-06 14:34:38,411 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 14:34:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:38,527 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2025-02-06 14:34:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:38,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 1043 [2025-02-06 14:34:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:38,529 INFO L225 Difference]: With dead ends: 142 [2025-02-06 14:34:38,529 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:34:38,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1063 GetRequests, 1043 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-02-06 14:34:38,534 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:38,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 212 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:34:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:34:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:34:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:34:38,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1043 [2025-02-06 14:34:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:38,535 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:34:38,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-06 14:34:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:34:38,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:34:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-02-06 14:34:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-02-06 14:34:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-02-06 14:34:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-02-06 14:34:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-02-06 14:34:38,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-02-06 14:34:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-02-06 14:34:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-02-06 14:34:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-02-06 14:34:38,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-02-06 14:34:38,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:38,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:38,742 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:38,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:35:43,283 WARN L286 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 106 DAG size of output: 72 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)