./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.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 6f3643eb7577eb0ba12bcd7a7f20ec9e29deb69664963fe3575fff225cd03ad0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:05:17,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:05:17,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:05:17,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:05:17,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:05:17,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:05:17,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:05:17,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:05:17,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:05:17,785 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:05:17,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:05:17,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:05:17,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:05:17,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:05:17,785 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:05:17,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:05:17,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:05:17,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:05:17,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:05:17,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:05:17,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:05:17,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:05:17,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:05:17,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:05:17,789 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:05:17,789 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:05:17,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:05:17,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:05:17,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:05:17,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:05:17,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:17,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:05:17,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:05:17,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:05:17,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:05:17,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:05:17,791 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 -> 6f3643eb7577eb0ba12bcd7a7f20ec9e29deb69664963fe3575fff225cd03ad0 [2025-02-08 10:05:18,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:05:18,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:05:18,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:05:18,028 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:05:18,028 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:05:18,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c [2025-02-08 10:05:19,159 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4efc37e35/181f22e3cca643b28f7477f1af6cfb71/FLAG70b1eaa40 [2025-02-08 10:05:19,346 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:05:19,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c [2025-02-08 10:05:19,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4efc37e35/181f22e3cca643b28f7477f1af6cfb71/FLAG70b1eaa40 [2025-02-08 10:05:19,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4efc37e35/181f22e3cca643b28f7477f1af6cfb71 [2025-02-08 10:05:19,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:05:19,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:05:19,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:19,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:05:19,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:05:19,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e600f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19, skipping insertion in model container [2025-02-08 10:05:19,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:05:19,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:19,862 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:05:19,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:05:19,898 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:05:19,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19 WrapperNode [2025-02-08 10:05:19,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:05:19,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:19,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:05:19,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:05:19,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,932 INFO L138 Inliner]: procedures = 16, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2025-02-08 10:05:19,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:05:19,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:05:19,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:05:19,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:05:19,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,963 INFO L175 MemorySlicer]: Split 56 memory accesses to 6 slices as follows [2, 6, 4, 5, 36, 3]. 64 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0, 0, 0, 0]. The 7 writes are split as follows [0, 0, 2, 2, 2, 1]. [2025-02-08 10:05:19,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:05:19,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:05:19,982 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:05:19,982 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:05:19,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (1/1) ... [2025-02-08 10:05:19,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:05:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:20,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 10:05:20,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 10:05:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:05:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_33_0 [2025-02-08 10:05:20,030 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_33_0 [2025-02-08 10:05:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:05:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:05:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:05:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:05:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:05:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:05:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:05:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:05:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:05:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:05:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:05:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:05:20,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:05:20,032 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:05:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:05:20,105 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:05:20,106 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:05:20,530 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~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; [2025-02-08 10:05:20,554 INFO L? ?]: Removed 366 outVars from TransFormulas that were not future-live. [2025-02-08 10:05:20,554 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:05:20,565 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:05:20,566 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:05:20,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:20 BoogieIcfgContainer [2025-02-08 10:05:20,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:05:20,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:05:20,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:05:20,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:05:20,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:05:19" (1/3) ... [2025-02-08 10:05:20,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd440b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:20, skipping insertion in model container [2025-02-08 10:05:20,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:05:19" (2/3) ... [2025-02-08 10:05:20,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd440b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:05:20, skipping insertion in model container [2025-02-08 10:05:20,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:05:20" (3/3) ... [2025-02-08 10:05:20,575 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps5.c [2025-02-08 10:05:20,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:05:20,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps5.c that has 3 procedures, 190 locations, 1 initial locations, 0 loop locations, and 84 error locations. [2025-02-08 10:05:20,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:05:20,634 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;@49972834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:05:20,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-02-08 10:05:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 183 states have internal predecessors, (185), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 10:05:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 10:05:20,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:20,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 10:05:20,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_25_to_33_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 208369109, now seen corresponding path program 1 times [2025-02-08 10:05:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158024506] [2025-02-08 10:05:20,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:20,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:20,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 10:05:20,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 10:05:20,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:20,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158024506] [2025-02-08 10:05:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158024506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:20,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:20,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753830391] [2025-02-08 10:05:20,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:21,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:21,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:21,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:21,024 INFO L87 Difference]: Start difference. First operand has 190 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 183 states have internal predecessors, (185), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:21,312 INFO L93 Difference]: Finished difference Result 526 states and 556 transitions. [2025-02-08 10:05:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:21,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 10:05:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:21,319 INFO L225 Difference]: With dead ends: 526 [2025-02-08 10:05:21,319 INFO L226 Difference]: Without dead ends: 333 [2025-02-08 10:05:21,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-08 10:05:21,323 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 264 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:21,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 718 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-08 10:05:21,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 226. [2025-02-08 10:05:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.8134328358208955) internal successors, (243), 218 states have internal predecessors, (243), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2025-02-08 10:05:21,363 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 254 transitions. Word has length 5 [2025-02-08 10:05:21,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:21,364 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 254 transitions. [2025-02-08 10:05:21,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 254 transitions. [2025-02-08 10:05:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 10:05:21,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:21,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:21,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:05:21,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_33_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:21,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash 71202859, now seen corresponding path program 1 times [2025-02-08 10:05:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:21,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900661649] [2025-02-08 10:05:21,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:21,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:05:21,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:05:21,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:21,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900661649] [2025-02-08 10:05:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900661649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:21,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:21,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596321444] [2025-02-08 10:05:21,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:21,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:21,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:21,523 INFO L87 Difference]: Start difference. First operand 226 states and 254 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:21,732 INFO L93 Difference]: Finished difference Result 333 states and 338 transitions. [2025-02-08 10:05:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:21,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 10:05:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:21,733 INFO L225 Difference]: With dead ends: 333 [2025-02-08 10:05:21,734 INFO L226 Difference]: Without dead ends: 325 [2025-02-08 10:05:21,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-08 10:05:21,734 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 220 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:21,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 689 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-08 10:05:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 226. [2025-02-08 10:05:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 218 states have internal predecessors, (235), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 246 transitions. [2025-02-08 10:05:21,746 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 246 transitions. Word has length 15 [2025-02-08 10:05:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:21,746 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 246 transitions. [2025-02-08 10:05:21,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 246 transitions. [2025-02-08 10:05:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 10:05:21,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:21,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:21,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:05:21,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_33_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:21,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:21,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1328780195, now seen corresponding path program 1 times [2025-02-08 10:05:21,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:21,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873853862] [2025-02-08 10:05:21,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:21,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:05:21,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:05:21,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:21,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:21,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044025925] [2025-02-08 10:05:21,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:21,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:21,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:21,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:21,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 10:05:21,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:05:21,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:05:21,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:21,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:21,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 10:05:21,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:21,896 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-08 10:05:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:21,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:21,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:21,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873853862] [2025-02-08 10:05:21,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044025925] [2025-02-08 10:05:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044025925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665384336] [2025-02-08 10:05:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:21,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:21,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:21,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:21,986 INFO L87 Difference]: Start difference. First operand 226 states and 246 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:22,189 INFO L93 Difference]: Finished difference Result 325 states and 330 transitions. [2025-02-08 10:05:22,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 10:05:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:22,191 INFO L225 Difference]: With dead ends: 325 [2025-02-08 10:05:22,191 INFO L226 Difference]: Without dead ends: 323 [2025-02-08 10:05:22,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:22,192 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 229 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:22,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 716 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-08 10:05:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 226. [2025-02-08 10:05:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.7388059701492538) internal successors, (233), 218 states have internal predecessors, (233), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2025-02-08 10:05:22,209 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 23 [2025-02-08 10:05:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:22,209 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2025-02-08 10:05:22,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2025-02-08 10:05:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 10:05:22,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:22,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:22,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:22,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:22,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_33_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:22,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1352481409, now seen corresponding path program 1 times [2025-02-08 10:05:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611845081] [2025-02-08 10:05:22,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:22,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 10:05:22,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 10:05:22,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:22,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:22,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:22,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611845081] [2025-02-08 10:05:22,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611845081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:22,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:22,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:22,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090419034] [2025-02-08 10:05:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:22,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:22,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:22,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:22,571 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:22,765 INFO L93 Difference]: Finished difference Result 323 states and 328 transitions. [2025-02-08 10:05:22,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:22,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 10:05:22,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:22,767 INFO L225 Difference]: With dead ends: 323 [2025-02-08 10:05:22,768 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 10:05:22,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-08 10:05:22,768 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 178 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:22,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 701 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 10:05:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 226. [2025-02-08 10:05:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6940298507462686) internal successors, (227), 218 states have internal predecessors, (227), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 238 transitions. [2025-02-08 10:05:22,784 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 238 transitions. Word has length 25 [2025-02-08 10:05:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 238 transitions. [2025-02-08 10:05:22,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 238 transitions. [2025-02-08 10:05:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 10:05:22,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:22,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:22,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:05:22,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_33_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:22,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1539002597, now seen corresponding path program 1 times [2025-02-08 10:05:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62488076] [2025-02-08 10:05:22,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:22,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:05:22,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:05:22,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:22,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:22,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063669987] [2025-02-08 10:05:22,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:22,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:22,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:22,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 10:05:22,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:05:22,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:05:22,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:22,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:22,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 10:05:22,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:22,872 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-08 10:05:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:23,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62488076] [2025-02-08 10:05:23,006 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:23,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063669987] [2025-02-08 10:05:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063669987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:23,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:23,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103821861] [2025-02-08 10:05:23,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:23,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:05:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:23,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:05:23,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:23,008 INFO L87 Difference]: Start difference. First operand 226 states and 238 transitions. Second operand has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:23,240 INFO L93 Difference]: Finished difference Result 317 states and 322 transitions. [2025-02-08 10:05:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-08 10:05:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:23,241 INFO L225 Difference]: With dead ends: 317 [2025-02-08 10:05:23,241 INFO L226 Difference]: Without dead ends: 315 [2025-02-08 10:05:23,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:05:23,242 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 177 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:23,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 830 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-08 10:05:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 226. [2025-02-08 10:05:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6791044776119404) internal successors, (225), 218 states have internal predecessors, (225), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 236 transitions. [2025-02-08 10:05:23,248 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 236 transitions. Word has length 31 [2025-02-08 10:05:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:23,248 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 236 transitions. [2025-02-08 10:05:23,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 236 transitions. [2025-02-08 10:05:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 10:05:23,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:23,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:23,256 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-08 10:05:23,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:23,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_33_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:23,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:23,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1512745479, now seen corresponding path program 1 times [2025-02-08 10:05:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:23,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934106618] [2025-02-08 10:05:23,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:23,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 10:05:23,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 10:05:23,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:23,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:23,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:23,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934106618] [2025-02-08 10:05:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934106618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:23,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336206442] [2025-02-08 10:05:23,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:23,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:23,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:23,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:23,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:23,568 INFO L87 Difference]: Start difference. First operand 226 states and 236 transitions. Second operand has 6 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:23,640 INFO L93 Difference]: Finished difference Result 313 states and 317 transitions. [2025-02-08 10:05:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:23,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 10:05:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:23,641 INFO L225 Difference]: With dead ends: 313 [2025-02-08 10:05:23,641 INFO L226 Difference]: Without dead ends: 311 [2025-02-08 10:05:23,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-08 10:05:23,642 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 167 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:23,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 861 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-08 10:05:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 226. [2025-02-08 10:05:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.664179104477612) internal successors, (223), 218 states have internal predecessors, (223), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 234 transitions. [2025-02-08 10:05:23,647 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 234 transitions. Word has length 33 [2025-02-08 10:05:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:23,647 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 234 transitions. [2025-02-08 10:05:23,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 234 transitions. [2025-02-08 10:05:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 10:05:23,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:23,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:23,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 10:05:23,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_25_to_33_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:23,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2049458985, now seen corresponding path program 1 times [2025-02-08 10:05:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178701380] [2025-02-08 10:05:23,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:23,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:23,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 10:05:23,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 10:05:23,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:23,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:23,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178701380] [2025-02-08 10:05:23,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178701380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:23,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:23,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:23,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244581435] [2025-02-08 10:05:23,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:23,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:23,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:23,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:23,791 INFO L87 Difference]: Start difference. First operand 226 states and 234 transitions. Second operand has 7 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:24,169 INFO L93 Difference]: Finished difference Result 311 states and 315 transitions. [2025-02-08 10:05:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:24,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 10:05:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:24,170 INFO L225 Difference]: With dead ends: 311 [2025-02-08 10:05:24,170 INFO L226 Difference]: Without dead ends: 310 [2025-02-08 10:05:24,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:24,171 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 170 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:24,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 832 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-08 10:05:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 226. [2025-02-08 10:05:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6567164179104477) internal successors, (222), 218 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 233 transitions. [2025-02-08 10:05:24,176 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 233 transitions. Word has length 35 [2025-02-08 10:05:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:24,176 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 233 transitions. [2025-02-08 10:05:24,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 233 transitions. [2025-02-08 10:05:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 10:05:24,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:24,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:24,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 10:05:24,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_25_to_33_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:24,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash 891280910, now seen corresponding path program 1 times [2025-02-08 10:05:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754800790] [2025-02-08 10:05:24,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:24,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 10:05:24,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 10:05:24,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:24,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:24,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:24,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754800790] [2025-02-08 10:05:24,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754800790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:24,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:24,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:24,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330970357] [2025-02-08 10:05:24,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:24,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:24,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:24,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:24,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:24,324 INFO L87 Difference]: Start difference. First operand 226 states and 233 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:24,521 INFO L93 Difference]: Finished difference Result 310 states and 314 transitions. [2025-02-08 10:05:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:24,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 10:05:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:24,523 INFO L225 Difference]: With dead ends: 310 [2025-02-08 10:05:24,523 INFO L226 Difference]: Without dead ends: 309 [2025-02-08 10:05:24,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-08 10:05:24,523 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 160 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:24,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 809 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-08 10:05:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 226. [2025-02-08 10:05:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 218 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 232 transitions. [2025-02-08 10:05:24,529 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 232 transitions. Word has length 36 [2025-02-08 10:05:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:24,529 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 232 transitions. [2025-02-08 10:05:24,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 232 transitions. [2025-02-08 10:05:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 10:05:24,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 10:05:24,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_33_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1859904437, now seen corresponding path program 1 times [2025-02-08 10:05:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387878298] [2025-02-08 10:05:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:24,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 10:05:24,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 10:05:24,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:24,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387878298] [2025-02-08 10:05:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387878298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:24,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:24,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026053085] [2025-02-08 10:05:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:24,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:24,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:24,662 INFO L87 Difference]: Start difference. First operand 226 states and 232 transitions. Second operand has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:24,949 INFO L93 Difference]: Finished difference Result 311 states and 316 transitions. [2025-02-08 10:05:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-08 10:05:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:24,951 INFO L225 Difference]: With dead ends: 311 [2025-02-08 10:05:24,951 INFO L226 Difference]: Without dead ends: 310 [2025-02-08 10:05:24,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:24,952 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 138 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:24,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 781 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:05:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-08 10:05:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 226. [2025-02-08 10:05:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 218 states have internal predecessors, (220), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 231 transitions. [2025-02-08 10:05:24,960 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 231 transitions. Word has length 37 [2025-02-08 10:05:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:24,960 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 231 transitions. [2025-02-08 10:05:24,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 231 transitions. [2025-02-08 10:05:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 10:05:24,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:24,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:24,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 10:05:24,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_25_to_33_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1822462700, now seen corresponding path program 1 times [2025-02-08 10:05:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658589844] [2025-02-08 10:05:24,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:24,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 10:05:24,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 10:05:24,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:24,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:25,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:25,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658589844] [2025-02-08 10:05:25,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658589844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:25,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:25,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:25,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563913559] [2025-02-08 10:05:25,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:25,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:25,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:25,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:25,106 INFO L87 Difference]: Start difference. First operand 226 states and 231 transitions. Second operand has 6 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:25,365 INFO L93 Difference]: Finished difference Result 310 states and 315 transitions. [2025-02-08 10:05:25,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:25,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-08 10:05:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:25,367 INFO L225 Difference]: With dead ends: 310 [2025-02-08 10:05:25,367 INFO L226 Difference]: Without dead ends: 309 [2025-02-08 10:05:25,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 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-08 10:05:25,368 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 135 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:25,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 692 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:25,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-08 10:05:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 226. [2025-02-08 10:05:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 218 states have internal predecessors, (219), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 230 transitions. [2025-02-08 10:05:25,380 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 230 transitions. Word has length 38 [2025-02-08 10:05:25,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:25,381 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 230 transitions. [2025-02-08 10:05:25,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:05:25,381 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2025-02-08 10:05:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 10:05:25,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:25,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:25,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 10:05:25,382 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_33_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:25,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1958385597, now seen corresponding path program 1 times [2025-02-08 10:05:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:25,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928607754] [2025-02-08 10:05:25,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:25,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 10:05:25,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 10:05:25,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:25,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:25,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:25,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928607754] [2025-02-08 10:05:25,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928607754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:25,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:25,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150989748] [2025-02-08 10:05:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:25,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:25,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:25,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:25,565 INFO L87 Difference]: Start difference. First operand 226 states and 230 transitions. Second operand has 7 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:25,639 INFO L93 Difference]: Finished difference Result 309 states and 313 transitions. [2025-02-08 10:05:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:25,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 46 [2025-02-08 10:05:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:25,640 INFO L225 Difference]: With dead ends: 309 [2025-02-08 10:05:25,640 INFO L226 Difference]: Without dead ends: 308 [2025-02-08 10:05:25,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:25,641 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 125 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:25,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1057 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-08 10:05:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 227. [2025-02-08 10:05:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.6296296296296295) internal successors, (220), 219 states have internal predecessors, (220), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2025-02-08 10:05:25,648 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 46 [2025-02-08 10:05:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:25,648 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2025-02-08 10:05:25,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2025-02-08 10:05:25,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 10:05:25,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:25,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:25,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 10:05:25,649 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_25_to_33_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:25,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash 580411354, now seen corresponding path program 1 times [2025-02-08 10:05:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:25,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239956090] [2025-02-08 10:05:25,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:25,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:25,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 10:05:25,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 10:05:25,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:25,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239956090] [2025-02-08 10:05:25,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239956090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:25,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:25,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:25,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294321113] [2025-02-08 10:05:25,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:25,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:05:25,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:25,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:05:25,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:05:25,794 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:25,853 INFO L93 Difference]: Finished difference Result 308 states and 312 transitions. [2025-02-08 10:05:25,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:05:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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 47 [2025-02-08 10:05:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:25,855 INFO L225 Difference]: With dead ends: 308 [2025-02-08 10:05:25,855 INFO L226 Difference]: Without dead ends: 307 [2025-02-08 10:05:25,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:25,855 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 122 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:25,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 922 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:05:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-08 10:05:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 228. [2025-02-08 10:05:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.625) internal successors, (221), 220 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 232 transitions. [2025-02-08 10:05:25,861 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 232 transitions. Word has length 47 [2025-02-08 10:05:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:25,861 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 232 transitions. [2025-02-08 10:05:25,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2025-02-08 10:05:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 10:05:25,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:25,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:25,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:05:25,863 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_33_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:25,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash 812882779, now seen corresponding path program 1 times [2025-02-08 10:05:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:25,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143528675] [2025-02-08 10:05:25,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:25,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 10:05:25,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 10:05:25,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:25,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:25,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:25,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143528675] [2025-02-08 10:05:25,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143528675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:25,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:25,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:05:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565108947] [2025-02-08 10:05:25,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:25,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:05:25,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:25,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:05:25,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:05:25,973 INFO L87 Difference]: Start difference. First operand 228 states and 232 transitions. Second operand has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:26,091 INFO L93 Difference]: Finished difference Result 307 states and 312 transitions. [2025-02-08 10:05:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:05:26,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 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 48 [2025-02-08 10:05:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:26,092 INFO L225 Difference]: With dead ends: 307 [2025-02-08 10:05:26,092 INFO L226 Difference]: Without dead ends: 305 [2025-02-08 10:05:26,092 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-08 10:05:26,093 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 121 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:26,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 748 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:05:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-08 10:05:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 230. [2025-02-08 10:05:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 138 states have (on average 1.6159420289855073) internal successors, (223), 222 states have internal predecessors, (223), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 10:05:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 234 transitions. [2025-02-08 10:05:26,098 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 234 transitions. Word has length 48 [2025-02-08 10:05:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:26,098 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 234 transitions. [2025-02-08 10:05:26,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2025-02-08 10:05:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 10:05:26,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:26,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:26,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 10:05:26,099 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:26,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash -569750947, now seen corresponding path program 1 times [2025-02-08 10:05:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943227257] [2025-02-08 10:05:26,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:26,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:26,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 10:05:26,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 10:05:26,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:26,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943227257] [2025-02-08 10:05:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943227257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:05:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548339022] [2025-02-08 10:05:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:26,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:05:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:05:26,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:05:26,188 INFO L87 Difference]: Start difference. First operand 230 states and 234 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:26,355 INFO L93 Difference]: Finished difference Result 307 states and 312 transitions. [2025-02-08 10:05:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:05:26,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2025-02-08 10:05:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:26,357 INFO L225 Difference]: With dead ends: 307 [2025-02-08 10:05:26,357 INFO L226 Difference]: Without dead ends: 297 [2025-02-08 10:05:26,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 10:05:26,358 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 158 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:26,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 460 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-08 10:05:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 243. [2025-02-08 10:05:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 150 states have (on average 1.5666666666666667) internal successors, (235), 233 states have internal predecessors, (235), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-02-08 10:05:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 247 transitions. [2025-02-08 10:05:26,363 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 247 transitions. Word has length 49 [2025-02-08 10:05:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:26,363 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 247 transitions. [2025-02-08 10:05:26,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:05:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 247 transitions. [2025-02-08 10:05:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 10:05:26,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:26,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:26,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 10:05:26,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:26,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash -503697671, now seen corresponding path program 1 times [2025-02-08 10:05:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:26,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65262802] [2025-02-08 10:05:26,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:26,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 10:05:26,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 10:05:26,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:26,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:26,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541058508] [2025-02-08 10:05:26,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:26,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:26,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:26,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:26,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 10:05:26,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 10:05:26,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 10:05:26,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:26,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:26,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 10:05:26,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:26,465 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-08 10:05:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:26,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:26,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65262802] [2025-02-08 10:05:26,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541058508] [2025-02-08 10:05:26,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541058508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:26,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:26,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:26,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308876708] [2025-02-08 10:05:26,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:26,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:05:26,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:26,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:05:26,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:26,593 INFO L87 Difference]: Start difference. First operand 243 states and 247 transitions. Second operand has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:26,813 INFO L93 Difference]: Finished difference Result 314 states and 324 transitions. [2025-02-08 10:05:26,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:26,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 50 [2025-02-08 10:05:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:26,815 INFO L225 Difference]: With dead ends: 314 [2025-02-08 10:05:26,815 INFO L226 Difference]: Without dead ends: 313 [2025-02-08 10:05:26,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:26,816 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 183 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:26,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 717 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-08 10:05:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 273. [2025-02-08 10:05:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 178 states have (on average 1.6123595505617978) internal successors, (287), 262 states have internal predecessors, (287), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 301 transitions. [2025-02-08 10:05:26,823 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 301 transitions. Word has length 50 [2025-02-08 10:05:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:26,823 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 301 transitions. [2025-02-08 10:05:26,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 301 transitions. [2025-02-08 10:05:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 10:05:26,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:26,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:26,831 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-08 10:05:27,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:27,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_25_to_33_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:27,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1565241366, now seen corresponding path program 1 times [2025-02-08 10:05:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:27,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914375723] [2025-02-08 10:05:27,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:27,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:27,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 10:05:27,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 10:05:27,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:27,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:27,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19073717] [2025-02-08 10:05:27,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:27,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:27,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:27,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:27,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 10:05:27,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 10:05:27,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 10:05:27,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:27,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:27,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 10:05:27,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:27,125 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-08 10:05:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:27,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:27,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:27,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914375723] [2025-02-08 10:05:27,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:27,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19073717] [2025-02-08 10:05:27,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19073717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:27,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:05:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55448783] [2025-02-08 10:05:27,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:27,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:05:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:27,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:05:27,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:05:27,242 INFO L87 Difference]: Start difference. First operand 273 states and 301 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:27,459 INFO L93 Difference]: Finished difference Result 314 states and 323 transitions. [2025-02-08 10:05:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:05:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 51 [2025-02-08 10:05:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:27,461 INFO L225 Difference]: With dead ends: 314 [2025-02-08 10:05:27,461 INFO L226 Difference]: Without dead ends: 313 [2025-02-08 10:05:27,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:27,462 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 118 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:27,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 848 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-08 10:05:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 274. [2025-02-08 10:05:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 263 states have internal predecessors, (288), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2025-02-08 10:05:27,468 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 51 [2025-02-08 10:05:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:27,468 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2025-02-08 10:05:27,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2025-02-08 10:05:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 10:05:27,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:27,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:27,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 10:05:27,673 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,SelfDestructingSolverStorable15 [2025-02-08 10:05:27,673 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_33_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:27,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1277842071, now seen corresponding path program 1 times [2025-02-08 10:05:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642942047] [2025-02-08 10:05:27,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:27,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 10:05:27,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 10:05:27,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:27,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1987253953] [2025-02-08 10:05:27,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:27,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:27,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:27,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:27,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 10:05:27,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 10:05:27,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 10:05:27,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:27,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:27,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 10:05:27,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:27,783 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-08 10:05:27,892 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 23 treesize of output 3 [2025-02-08 10:05:27,917 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 29 treesize of output 13 [2025-02-08 10:05:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:27,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642942047] [2025-02-08 10:05:27,930 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:27,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987253953] [2025-02-08 10:05:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987253953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035606550] [2025-02-08 10:05:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:27,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:05:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:27,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:05:27,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:27,931 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand has 9 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:28,187 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2025-02-08 10:05:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 52 [2025-02-08 10:05:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:28,188 INFO L225 Difference]: With dead ends: 314 [2025-02-08 10:05:28,188 INFO L226 Difference]: Without dead ends: 313 [2025-02-08 10:05:28,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:05:28,189 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 125 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:28,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 877 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-08 10:05:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 275. [2025-02-08 10:05:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 180 states have (on average 1.6055555555555556) internal successors, (289), 264 states have internal predecessors, (289), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-02-08 10:05:28,197 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 52 [2025-02-08 10:05:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:28,198 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-02-08 10:05:28,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-02-08 10:05:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 10:05:28,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:28,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:28,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 10:05:28,398 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,SelfDestructingSolverStorable16 [2025-02-08 10:05:28,399 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_25_to_33_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:28,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:28,399 INFO L85 PathProgramCache]: Analyzing trace with hash 958398516, now seen corresponding path program 1 times [2025-02-08 10:05:28,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:28,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765953576] [2025-02-08 10:05:28,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:28,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 10:05:28,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 10:05:28,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:28,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:28,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844006621] [2025-02-08 10:05:28,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:28,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:28,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:05:28,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 10:05:28,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 10:05:28,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 10:05:28,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:28,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:28,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 10:05:28,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:28,527 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-08 10:05:28,612 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-08 10:05:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:28,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:28,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:28,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765953576] [2025-02-08 10:05:28,642 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:28,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844006621] [2025-02-08 10:05:28,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844006621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:28,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:28,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:05:28,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685976423] [2025-02-08 10:05:28,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:28,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:05:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:28,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:05:28,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:05:28,644 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:28,839 INFO L93 Difference]: Finished difference Result 314 states and 321 transitions. [2025-02-08 10:05:28,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:05:28,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 53 [2025-02-08 10:05:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:28,840 INFO L225 Difference]: With dead ends: 314 [2025-02-08 10:05:28,840 INFO L226 Difference]: Without dead ends: 313 [2025-02-08 10:05:28,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:05:28,841 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 186 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:28,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 803 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:28,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-08 10:05:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 276. [2025-02-08 10:05:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 181 states have (on average 1.6022099447513811) internal successors, (290), 265 states have internal predecessors, (290), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2025-02-08 10:05:28,849 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 53 [2025-02-08 10:05:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:28,850 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2025-02-08 10:05:28,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2025-02-08 10:05:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 10:05:28,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:28,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:28,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 10:05:29,051 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,SelfDestructingSolverStorable17 [2025-02-08 10:05:29,051 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_25_to_33_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:29,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash -354417099, now seen corresponding path program 1 times [2025-02-08 10:05:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954665946] [2025-02-08 10:05:29,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:29,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:29,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 10:05:29,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 10:05:29,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:29,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464604497] [2025-02-08 10:05:29,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:29,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:29,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:29,078 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-08 10:05:29,079 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-08 10:05:29,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 10:05:29,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 10:05:29,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:29,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:29,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 10:05:29,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:29,163 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-08 10:05:29,267 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 23 treesize of output 3 [2025-02-08 10:05:29,311 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 36 treesize of output 16 [2025-02-08 10:05:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:29,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954665946] [2025-02-08 10:05:29,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:29,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464604497] [2025-02-08 10:05:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464604497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:29,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 10:05:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437362159] [2025-02-08 10:05:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:29,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 10:05:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:29,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 10:05:29,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:29,330 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 10 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:29,580 INFO L93 Difference]: Finished difference Result 314 states and 320 transitions. [2025-02-08 10:05:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:05:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 54 [2025-02-08 10:05:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:29,581 INFO L225 Difference]: With dead ends: 314 [2025-02-08 10:05:29,581 INFO L226 Difference]: Without dead ends: 313 [2025-02-08 10:05:29,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 10:05:29,581 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 187 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:29,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 914 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-08 10:05:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 277. [2025-02-08 10:05:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 182 states have (on average 1.598901098901099) internal successors, (291), 266 states have internal predecessors, (291), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 305 transitions. [2025-02-08 10:05:29,588 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 305 transitions. Word has length 54 [2025-02-08 10:05:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:29,588 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 305 transitions. [2025-02-08 10:05:29,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 305 transitions. [2025-02-08 10:05:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 10:05:29,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:29,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:29,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 10:05:29,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:29,789 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_25_to_33_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:29,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:29,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1897971794, now seen corresponding path program 1 times [2025-02-08 10:05:29,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:29,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791174455] [2025-02-08 10:05:29,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:29,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:29,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 10:05:29,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 10:05:29,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:29,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:05:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1659056758] [2025-02-08 10:05:29,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:29,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:29,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:05:29,810 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-08 10:05:29,811 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-08 10:05:29,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 10:05:29,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 10:05:29,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:29,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:05:29,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 10:05:29,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:05:29,898 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-08 10:05:29,990 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-08 10:05:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:05:30,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:05:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:05:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791174455] [2025-02-08 10:05:30,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:05:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659056758] [2025-02-08 10:05:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659056758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:05:30,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:05:30,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 10:05:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291541373] [2025-02-08 10:05:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:05:30,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 10:05:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:05:30,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 10:05:30,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:05:30,050 INFO L87 Difference]: Start difference. First operand 277 states and 305 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:05:30,293 INFO L93 Difference]: Finished difference Result 314 states and 319 transitions. [2025-02-08 10:05:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:05:30,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 55 [2025-02-08 10:05:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:05:30,294 INFO L225 Difference]: With dead ends: 314 [2025-02-08 10:05:30,294 INFO L226 Difference]: Without dead ends: 313 [2025-02-08 10:05:30,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-08 10:05:30,295 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 118 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:05:30,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1102 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:05:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-08 10:05:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 278. [2025-02-08 10:05:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 183 states have (on average 1.5956284153005464) internal successors, (292), 267 states have internal predecessors, (292), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 10:05:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2025-02-08 10:05:30,300 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 55 [2025-02-08 10:05:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:05:30,300 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2025-02-08 10:05:30,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:05:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2025-02-08 10:05:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 10:05:30,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:05:30,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:05:30,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 10:05:30,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:05:30,505 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-02-08 10:05:30,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:05:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1292416557, now seen corresponding path program 1 times [2025-02-08 10:05:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:05:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139675901] [2025-02-08 10:05:30,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:05:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:05:30,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 10:05:30,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 10:05:30,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:05:30,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat