./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_egcd.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_egcd.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 56632fc3bb2b6db322c5e40eff8fe15b1c7affe1d35304d711252a046867d952 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:44:24,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:44:24,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:44:24,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:44:24,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:44:24,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:44:24,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:44:24,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:44:24,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:44:24,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:44:24,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:44:24,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:44:24,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:44:24,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:44:24,889 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:44:24,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:44:24,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:44:24,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:44:24,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:44:24,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:44:24,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:44:24,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:44:24,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:44:24,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:44:24,892 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/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 -> 56632fc3bb2b6db322c5e40eff8fe15b1c7affe1d35304d711252a046867d952 [2025-03-09 02:44:25,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:44:25,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:44:25,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:44:25,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:44:25,102 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:44:25,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_egcd.c [2025-03-09 02:44:26,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a739ddb/96d262ca94ed49a9a77acbcef6da9ea2/FLAG765af5155 [2025-03-09 02:44:26,446 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:44:26,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_egcd.c [2025-03-09 02:44:26,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a739ddb/96d262ca94ed49a9a77acbcef6da9ea2/FLAG765af5155 [2025-03-09 02:44:26,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a739ddb/96d262ca94ed49a9a77acbcef6da9ea2 [2025-03-09 02:44:26,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:44:26,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:44:26,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:44:26,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:44:26,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:44:26,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6267d77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26, skipping insertion in model container [2025-03-09 02:44:26,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:44:26,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:44:26,599 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:44:26,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:44:26,638 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:44:26,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26 WrapperNode [2025-03-09 02:44:26,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:44:26,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:44:26,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:44:26,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:44:26,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,670 INFO L138 Inliner]: procedures = 16, calls = 114, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 151 [2025-03-09 02:44:26,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:44:26,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:44:26,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:44:26,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:44:26,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,702 INFO L175 MemorySlicer]: Split 73 memory accesses to 10 slices as follows [2, 8, 7, 8, 8, 10, 8, 7, 7, 8]. 14 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7, 0, 0, 0, 0, 0, 0, 0]. The 14 writes are split as follows [0, 2, 0, 2, 2, 2, 2, 1, 1, 2]. [2025-03-09 02:44:26,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:44:26,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:44:26,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:44:26,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:44:26,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (1/1) ... [2025-03-09 02:44:26,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:44:26,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:26,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:44:26,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:44:26,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:44:26,765 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_33_to_48_0 [2025-03-09 02:44:26,765 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_33_to_48_0 [2025-03-09 02:44:26,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:44:26,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:44:26,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:44:26,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:44:26,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:44:26,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:44:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:44:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:44:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 02:44:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 02:44:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 02:44:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 02:44:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:44:26,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:44:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:44:26,841 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:44:26,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:44:27,213 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#p~0#1.base, main_~#p~0#1.offset);havoc main_~#p~0#1.base, main_~#p~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset;call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset);havoc main_~#r~0#1.base, main_~#r~0#1.offset;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset; [2025-03-09 02:44:27,244 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live. [2025-03-09 02:44:27,246 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:44:27,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:44:27,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:44:27,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:44:27 BoogieIcfgContainer [2025-03-09 02:44:27,255 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:44:27,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:44:27,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:44:27,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:44:27,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:44:26" (1/3) ... [2025-03-09 02:44:27,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efe85f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:44:27, skipping insertion in model container [2025-03-09 02:44:27,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:26" (2/3) ... [2025-03-09 02:44:27,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efe85f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:44:27, skipping insertion in model container [2025-03-09 02:44:27,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:44:27" (3/3) ... [2025-03-09 02:44:27,262 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_egcd.c [2025-03-09 02:44:27,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:44:27,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_egcd.c that has 4 procedures, 154 locations, 1 initial locations, 0 loop locations, and 56 error locations. [2025-03-09 02:44:27,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:44:27,324 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;@274df9c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:44:27,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-09 02:44:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 83 states have (on average 1.7349397590361446) internal successors, (144), 140 states have internal predecessors, (144), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 02:44:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:44:27,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:27,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:27,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_33_to_48_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:27,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:27,339 INFO L85 PathProgramCache]: Analyzing trace with hash 325402619, now seen corresponding path program 1 times [2025-03-09 02:44:27,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:27,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343633383] [2025-03-09 02:44:27,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:27,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:44:27,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:44:27,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:27,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:44:27,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343633383] [2025-03-09 02:44:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343633383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497745624] [2025-03-09 02:44:27,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:27,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:27,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:27,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:44:27,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:44:27,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:44:27,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:27,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:27,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 02:44:27,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:44:27,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497745624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:27,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:44:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-09 02:44:27,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649021761] [2025-03-09 02:44:27,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:27,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:44:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:27,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:44:27,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:44:27,701 INFO L87 Difference]: Start difference. First operand has 154 states, 83 states have (on average 1.7349397590361446) internal successors, (144), 140 states have internal predecessors, (144), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:44:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:27,722 INFO L93 Difference]: Finished difference Result 304 states and 338 transitions. [2025-03-09 02:44:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:44:27,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-09 02:44:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:27,727 INFO L225 Difference]: With dead ends: 304 [2025-03-09 02:44:27,728 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 02:44:27,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:44:27,734 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:27,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:44:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 02:44:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-09 02:44:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 78 states have (on average 1.7307692307692308) internal successors, (135), 134 states have internal predecessors, (135), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:44:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2025-03-09 02:44:27,768 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 18 [2025-03-09 02:44:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:27,769 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2025-03-09 02:44:27,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:44:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2025-03-09 02:44:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 02:44:27,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:27,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:27,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:44:27,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-09 02:44:27,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_33_to_48_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:27,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1562654329, now seen corresponding path program 1 times [2025-03-09 02:44:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553285877] [2025-03-09 02:44:27,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:27,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:44:28,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:44:28,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:28,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170751045] [2025-03-09 02:44:28,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:28,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:28,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:28,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:28,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:44:28,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 02:44:28,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 02:44:28,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:28,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:28,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 02:44:28,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:28,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:28,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:28,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:28,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:28,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553285877] [2025-03-09 02:44:28,274 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:28,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170751045] [2025-03-09 02:44:28,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170751045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:28,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:28,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165843821] [2025-03-09 02:44:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:28,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:28,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:28,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:28,276 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:28,453 INFO L93 Difference]: Finished difference Result 244 states and 259 transitions. [2025-03-09 02:44:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:28,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-09 02:44:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:28,455 INFO L225 Difference]: With dead ends: 244 [2025-03-09 02:44:28,455 INFO L226 Difference]: Without dead ends: 243 [2025-03-09 02:44:28,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:44:28,455 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 159 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:28,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 659 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-09 02:44:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 176. [2025-03-09 02:44:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 103 states have (on average 1.7281553398058251) internal successors, (178), 159 states have internal predecessors, (178), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-09 02:44:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2025-03-09 02:44:28,474 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 18 [2025-03-09 02:44:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:28,474 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2025-03-09 02:44:28,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2025-03-09 02:44:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 02:44:28,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:28,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:28,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:44:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-09 02:44:28,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_33_to_48_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:28,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1197643982, now seen corresponding path program 1 times [2025-03-09 02:44:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975384170] [2025-03-09 02:44:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:28,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:44:28,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:44:28,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:28,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995025892] [2025-03-09 02:44:28,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:28,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:28,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:28,717 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:28,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:44:28,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:44:28,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:44:28,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:28,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:28,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 02:44:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:28,837 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-03-09 02:44:28,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:28,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:28,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:28,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:28,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975384170] [2025-03-09 02:44:28,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:28,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995025892] [2025-03-09 02:44:28,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995025892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:28,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:28,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:28,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238768981] [2025-03-09 02:44:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:28,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:28,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:28,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:28,908 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:29,104 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2025-03-09 02:44:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:29,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-09 02:44:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:29,106 INFO L225 Difference]: With dead ends: 243 [2025-03-09 02:44:29,106 INFO L226 Difference]: Without dead ends: 242 [2025-03-09 02:44:29,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 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-03-09 02:44:29,107 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 156 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:29,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 661 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:44:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-09 02:44:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 176. [2025-03-09 02:44:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 103 states have (on average 1.7184466019417475) internal successors, (177), 159 states have internal predecessors, (177), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-09 02:44:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 204 transitions. [2025-03-09 02:44:29,118 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 204 transitions. Word has length 19 [2025-03-09 02:44:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:29,118 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 204 transitions. [2025-03-09 02:44:29,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 204 transitions. [2025-03-09 02:44:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:44:29,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:29,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:29,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:44:29,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:29,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_33_to_48_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:29,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1527742185, now seen corresponding path program 1 times [2025-03-09 02:44:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664037445] [2025-03-09 02:44:29,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:29,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:44:29,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:44:29,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:29,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:29,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811462526] [2025-03-09 02:44:29,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:29,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:29,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:29,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:29,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:44:29,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:44:29,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:44:29,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:29,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:29,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:44:29,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:29,485 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-03-09 02:44:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:29,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:29,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664037445] [2025-03-09 02:44:29,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:29,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811462526] [2025-03-09 02:44:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811462526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19696097] [2025-03-09 02:44:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:29,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:29,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:29,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:29,509 INFO L87 Difference]: Start difference. First operand 176 states and 204 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:29,642 INFO L93 Difference]: Finished difference Result 276 states and 313 transitions. [2025-03-09 02:44:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:44:29,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-09 02:44:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:29,645 INFO L225 Difference]: With dead ends: 276 [2025-03-09 02:44:29,645 INFO L226 Difference]: Without dead ends: 274 [2025-03-09 02:44:29,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-03-09 02:44:29,645 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 158 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:29,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 678 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-09 02:44:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 215. [2025-03-09 02:44:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 136 states have (on average 1.7058823529411764) internal successors, (232), 193 states have internal predecessors, (232), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-03-09 02:44:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2025-03-09 02:44:29,666 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 20 [2025-03-09 02:44:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:29,667 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2025-03-09 02:44:29,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2025-03-09 02:44:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 02:44:29,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:29,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:29,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:44:29,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:29,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_33_to_48_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:29,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash 718576565, now seen corresponding path program 1 times [2025-03-09 02:44:29,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:29,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59045776] [2025-03-09 02:44:29,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:29,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:29,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:44:29,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:44:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:29,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534913776] [2025-03-09 02:44:29,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:29,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:29,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:29,915 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:29,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:44:29,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:44:29,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:44:29,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:29,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:30,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-09 02:44:30,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:30,015 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-03-09 02:44:30,020 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-03-09 02:44:30,025 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-03-09 02:44:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:30,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:30,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59045776] [2025-03-09 02:44:30,115 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:30,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534913776] [2025-03-09 02:44:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534913776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:30,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:30,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284937888] [2025-03-09 02:44:30,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:30,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:30,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:30,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:44:30,117 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:30,308 INFO L93 Difference]: Finished difference Result 275 states and 319 transitions. [2025-03-09 02:44:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:44:30,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-09 02:44:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:30,309 INFO L225 Difference]: With dead ends: 275 [2025-03-09 02:44:30,309 INFO L226 Difference]: Without dead ends: 273 [2025-03-09 02:44:30,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:44:30,310 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 144 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:30,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 761 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-09 02:44:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 215. [2025-03-09 02:44:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 136 states have (on average 1.6911764705882353) internal successors, (230), 193 states have internal predecessors, (230), 17 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-03-09 02:44:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 268 transitions. [2025-03-09 02:44:30,319 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 268 transitions. Word has length 22 [2025-03-09 02:44:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:30,319 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 268 transitions. [2025-03-09 02:44:30,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 268 transitions. [2025-03-09 02:44:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:44:30,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:30,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:30,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:44:30,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:30,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_33_to_48_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:30,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1275265278, now seen corresponding path program 1 times [2025-03-09 02:44:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:30,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622962122] [2025-03-09 02:44:30,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:30,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:30,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:44:30,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:44:30,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:30,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:30,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320189007] [2025-03-09 02:44:30,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:30,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:30,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:30,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:30,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:44:30,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:44:30,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:44:30,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:30,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:44:30,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:30,659 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-03-09 02:44:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:30,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:30,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622962122] [2025-03-09 02:44:30,731 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:30,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320189007] [2025-03-09 02:44:30,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320189007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:30,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:30,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506355263] [2025-03-09 02:44:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:30,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:30,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:30,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:44:30,733 INFO L87 Difference]: Start difference. First operand 215 states and 268 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:30,853 INFO L93 Difference]: Finished difference Result 339 states and 374 transitions. [2025-03-09 02:44:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:44:30,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-09 02:44:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:30,855 INFO L225 Difference]: With dead ends: 339 [2025-03-09 02:44:30,855 INFO L226 Difference]: Without dead ends: 337 [2025-03-09 02:44:30,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:44:30,856 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 302 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:30,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 638 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-09 02:44:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 243. [2025-03-09 02:44:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 160 states have (on average 1.675) internal successors, (268), 217 states have internal predecessors, (268), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-03-09 02:44:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 312 transitions. [2025-03-09 02:44:30,867 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 312 transitions. Word has length 30 [2025-03-09 02:44:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:30,867 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 312 transitions. [2025-03-09 02:44:30,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 312 transitions. [2025-03-09 02:44:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:44:30,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:30,868 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:30,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:44:31,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:31,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_33_to_48_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:31,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252000, now seen corresponding path program 1 times [2025-03-09 02:44:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160251012] [2025-03-09 02:44:31,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:31,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:44:31,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:44:31,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:31,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:31,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614135028] [2025-03-09 02:44:31,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:31,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:31,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:31,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:44:31,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:44:31,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:44:31,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:31,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:31,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 02:44:31,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:31,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:31,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:31,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:31,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:44:31,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:44:31,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160251012] [2025-03-09 02:44:31,525 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614135028] [2025-03-09 02:44:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614135028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:31,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:44:31,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-09 02:44:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544753556] [2025-03-09 02:44:31,525 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:44:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:44:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:31,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:44:31,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:44:31,526 INFO L87 Difference]: Start difference. First operand 243 states and 312 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:44:35,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:44:39,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:44:43,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:44:47,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:44:51,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:44:55,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:44:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:55,944 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2025-03-09 02:44:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 02:44:55,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2025-03-09 02:44:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:55,947 INFO L225 Difference]: With dead ends: 341 [2025-03-09 02:44:55,947 INFO L226 Difference]: Without dead ends: 340 [2025-03-09 02:44:55,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:44:55,947 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 460 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 29 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:55,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 975 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 277 Invalid, 6 Unknown, 0 Unchecked, 24.3s Time] [2025-03-09 02:44:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-09 02:44:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 247. [2025-03-09 02:44:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 163 states have (on average 1.6503067484662577) internal successors, (269), 220 states have internal predecessors, (269), 20 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-03-09 02:44:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 313 transitions. [2025-03-09 02:44:55,965 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 313 transitions. Word has length 32 [2025-03-09 02:44:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:55,966 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 313 transitions. [2025-03-09 02:44:55,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:44:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2025-03-09 02:44:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 02:44:55,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:55,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:55,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:44:56,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:56,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_33_to_48_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:56,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1852828277, now seen corresponding path program 1 times [2025-03-09 02:44:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:56,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717771389] [2025-03-09 02:44:56,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:56,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:44:56,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:44:56,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:56,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198200968] [2025-03-09 02:44:56,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:56,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:56,208 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:56,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:44:56,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 02:44:56,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 02:44:56,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:56,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:56,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 02:44:56,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:56,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:56,373 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-03-09 02:44:56,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:56,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:56,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:56,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717771389] [2025-03-09 02:44:56,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198200968] [2025-03-09 02:44:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198200968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:56,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:44:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281697444] [2025-03-09 02:44:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:56,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:44:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:56,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:44:56,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:44:56,480 INFO L87 Difference]: Start difference. First operand 247 states and 313 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:56,725 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2025-03-09 02:44:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:44:56,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-09 02:44:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:56,727 INFO L225 Difference]: With dead ends: 340 [2025-03-09 02:44:56,727 INFO L226 Difference]: Without dead ends: 339 [2025-03-09 02:44:56,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:44:56,728 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 523 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:56,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 712 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:44:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-09 02:44:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 247. [2025-03-09 02:44:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 163 states have (on average 1.638036809815951) internal successors, (267), 220 states have internal predecessors, (267), 20 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-03-09 02:44:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 311 transitions. [2025-03-09 02:44:56,752 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 311 transitions. Word has length 33 [2025-03-09 02:44:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:56,753 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 311 transitions. [2025-03-09 02:44:56,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 311 transitions. [2025-03-09 02:44:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 02:44:56,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:56,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:56,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:44:56,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-09 02:44:56,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_33_to_48_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1603101758, now seen corresponding path program 1 times [2025-03-09 02:44:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621129231] [2025-03-09 02:44:56,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:56,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:44:56,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:44:56,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:56,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:56,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445523835] [2025-03-09 02:44:56,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:56,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:56,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:56,985 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:56,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:44:57,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:44:57,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:44:57,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:57,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:57,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-09 02:44:57,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:57,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:57,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:57,144 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-03-09 02:44:57,149 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-03-09 02:44:57,288 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 7 treesize of output 3 [2025-03-09 02:44:57,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 17 treesize of output 9 [2025-03-09 02:44:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:57,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:57,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:57,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621129231] [2025-03-09 02:44:57,343 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:57,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445523835] [2025-03-09 02:44:57,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445523835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:57,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:57,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 02:44:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388392804] [2025-03-09 02:44:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:57,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:44:57,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:57,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:44:57,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:44:57,344 INFO L87 Difference]: Start difference. First operand 247 states and 311 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:57,760 INFO L93 Difference]: Finished difference Result 335 states and 365 transitions. [2025-03-09 02:44:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:44:57,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-09 02:44:57,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:57,761 INFO L225 Difference]: With dead ends: 335 [2025-03-09 02:44:57,761 INFO L226 Difference]: Without dead ends: 334 [2025-03-09 02:44:57,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:44:57,762 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 478 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:57,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 911 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:44:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-09 02:44:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 247. [2025-03-09 02:44:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 163 states have (on average 1.6257668711656441) internal successors, (265), 220 states have internal predecessors, (265), 20 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-03-09 02:44:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2025-03-09 02:44:57,772 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 34 [2025-03-09 02:44:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:57,772 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2025-03-09 02:44:57,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2025-03-09 02:44:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:44:57,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:57,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:57,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:44:57,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:57,974 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_33_to_48_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:57,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:57,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1843453037, now seen corresponding path program 1 times [2025-03-09 02:44:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:57,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813554539] [2025-03-09 02:44:57,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:57,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:44:57,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:44:57,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:57,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53580689] [2025-03-09 02:44:57,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:57,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:57,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:58,001 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:58,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:44:58,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:44:58,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:44:58,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:58,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:58,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-09 02:44:58,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:58,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:58,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:58,162 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-03-09 02:44:58,168 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-03-09 02:44:58,316 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 7 treesize of output 3 [2025-03-09 02:44:58,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:58,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:58,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:58,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813554539] [2025-03-09 02:44:58,363 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:58,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53580689] [2025-03-09 02:44:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53580689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:58,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 02:44:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972699976] [2025-03-09 02:44:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:58,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:44:58,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:58,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:44:58,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:44:58,365 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:58,720 INFO L93 Difference]: Finished difference Result 334 states and 363 transitions. [2025-03-09 02:44:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:44:58,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-09 02:44:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:58,722 INFO L225 Difference]: With dead ends: 334 [2025-03-09 02:44:58,722 INFO L226 Difference]: Without dead ends: 333 [2025-03-09 02:44:58,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:44:58,723 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 449 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:58,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 852 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:44:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-09 02:44:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 247. [2025-03-09 02:44:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 163 states have (on average 1.6134969325153374) internal successors, (263), 220 states have internal predecessors, (263), 20 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-03-09 02:44:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2025-03-09 02:44:58,738 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 35 [2025-03-09 02:44:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:58,738 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2025-03-09 02:44:58,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2025-03-09 02:44:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 02:44:58,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:58,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:58,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:44:58,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 02:44:58,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_33_to_48_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:58,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1743796885, now seen corresponding path program 1 times [2025-03-09 02:44:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:58,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48060823] [2025-03-09 02:44:58,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:58,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:44:58,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:44:58,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:58,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:58,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008034562] [2025-03-09 02:44:58,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:58,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:58,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:58,977 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:58,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:44:59,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:44:59,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:44:59,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:59,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:59,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:44:59,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:59,088 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-03-09 02:44:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:44:59,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48060823] [2025-03-09 02:44:59,157 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008034562] [2025-03-09 02:44:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008034562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:59,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199528572] [2025-03-09 02:44:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:59,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:59,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:59,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:59,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:44:59,158 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:44:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:59,319 INFO L93 Difference]: Finished difference Result 435 states and 511 transitions. [2025-03-09 02:44:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:44:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-09 02:44:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:59,321 INFO L225 Difference]: With dead ends: 435 [2025-03-09 02:44:59,321 INFO L226 Difference]: Without dead ends: 433 [2025-03-09 02:44:59,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:44:59,322 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 274 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:59,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 706 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-09 02:44:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 343. [2025-03-09 02:44:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.6489795918367347) internal successors, (404), 303 states have internal predecessors, (404), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:44:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 471 transitions. [2025-03-09 02:44:59,345 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 471 transitions. Word has length 42 [2025-03-09 02:44:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 471 transitions. [2025-03-09 02:44:59,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:44:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 471 transitions. [2025-03-09 02:44:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:44:59,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:59,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:59,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:44:59,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 02:44:59,547 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_33_to_48_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:44:59,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash 751561395, now seen corresponding path program 1 times [2025-03-09 02:44:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:59,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323586222] [2025-03-09 02:44:59,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:59,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:44:59,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:44:59,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:59,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [929362595] [2025-03-09 02:44:59,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:59,576 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:44:59,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:44:59,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:44:59,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:44:59,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:59,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:59,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 02:44:59,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:59,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:59,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:59,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:59,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:44:59,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:59,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323586222] [2025-03-09 02:44:59,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929362595] [2025-03-09 02:44:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929362595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 02:44:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709081248] [2025-03-09 02:44:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:59,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:44:59,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:59,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:44:59,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:44:59,889 INFO L87 Difference]: Start difference. First operand 343 states and 471 transitions. Second operand has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:45:03,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:08,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:12,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:16,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:20,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:20,204 INFO L93 Difference]: Finished difference Result 443 states and 519 transitions. [2025-03-09 02:45:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:45:20,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2025-03-09 02:45:20,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:20,207 INFO L225 Difference]: With dead ends: 443 [2025-03-09 02:45:20,207 INFO L226 Difference]: Without dead ends: 442 [2025-03-09 02:45:20,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:45:20,207 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 268 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 18 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:20,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1266 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 317 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2025-03-09 02:45:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-09 02:45:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 343. [2025-03-09 02:45:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 303 states have internal predecessors, (402), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:45:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 469 transitions. [2025-03-09 02:45:20,222 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 469 transitions. Word has length 44 [2025-03-09 02:45:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:20,222 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 469 transitions. [2025-03-09 02:45:20,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:45:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 469 transitions. [2025-03-09 02:45:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:45:20,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:20,223 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:20,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:45:20,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 02:45:20,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_33_to_48_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:20,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1823566772, now seen corresponding path program 1 times [2025-03-09 02:45:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144778868] [2025-03-09 02:45:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:20,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:45:20,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:45:20,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:20,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:20,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376593628] [2025-03-09 02:45:20,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:20,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:20,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:20,460 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:20,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:45:20,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:45:20,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:45:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:20,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:20,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 02:45:20,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:20,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:20,644 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-03-09 02:45:20,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 02:45:20,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-03-09 02:45:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:45:20,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:45:20,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144778868] [2025-03-09 02:45:20,989 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376593628] [2025-03-09 02:45:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376593628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:20,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:20,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-09 02:45:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775832743] [2025-03-09 02:45:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:45:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:20,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:45:20,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:45:20,990 INFO L87 Difference]: Start difference. First operand 343 states and 469 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:45:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:21,477 INFO L93 Difference]: Finished difference Result 442 states and 517 transitions. [2025-03-09 02:45:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:45:21,477 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2025-03-09 02:45:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:21,479 INFO L225 Difference]: With dead ends: 442 [2025-03-09 02:45:21,479 INFO L226 Difference]: Without dead ends: 441 [2025-03-09 02:45:21,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:45:21,479 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 504 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:21,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1215 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:45:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-09 02:45:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 343. [2025-03-09 02:45:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.6326530612244898) internal successors, (400), 303 states have internal predecessors, (400), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:45:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 467 transitions. [2025-03-09 02:45:21,500 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 467 transitions. Word has length 45 [2025-03-09 02:45:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:21,500 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 467 transitions. [2025-03-09 02:45:21,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:45:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 467 transitions. [2025-03-09 02:45:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:45:21,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:21,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:21,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 02:45:21,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 02:45:21,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_33_to_48_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:21,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 695995089, now seen corresponding path program 1 times [2025-03-09 02:45:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130928138] [2025-03-09 02:45:21,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:21,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:45:21,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:45:21,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:21,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569436212] [2025-03-09 02:45:21,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:21,724 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:21,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 02:45:21,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:45:21,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:45:21,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:21,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:21,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-09 02:45:21,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:21,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:21,870 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-03-09 02:45:21,873 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-03-09 02:45:22,072 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 7 treesize of output 3 [2025-03-09 02:45:22,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-09 02:45:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:45:22,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:45:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:22,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130928138] [2025-03-09 02:45:22,111 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:22,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569436212] [2025-03-09 02:45:22,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569436212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:22,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:22,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 02:45:22,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789134935] [2025-03-09 02:45:22,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:22,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:45:22,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:22,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:45:22,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:45:22,112 INFO L87 Difference]: Start difference. First operand 343 states and 467 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:45:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:22,515 INFO L93 Difference]: Finished difference Result 431 states and 503 transitions. [2025-03-09 02:45:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:45:22,515 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-09 02:45:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:22,517 INFO L225 Difference]: With dead ends: 431 [2025-03-09 02:45:22,517 INFO L226 Difference]: Without dead ends: 430 [2025-03-09 02:45:22,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:45:22,518 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 496 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:22,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 934 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:45:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-09 02:45:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 343. [2025-03-09 02:45:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 303 states have internal predecessors, (398), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:45:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 465 transitions. [2025-03-09 02:45:22,538 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 465 transitions. Word has length 46 [2025-03-09 02:45:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:22,539 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 465 transitions. [2025-03-09 02:45:22,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:45:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 465 transitions. [2025-03-09 02:45:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 02:45:22,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:22,540 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:22,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 02:45:22,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:22,741 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_33_to_48_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:22,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash 101011282, now seen corresponding path program 1 times [2025-03-09 02:45:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:22,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456287611] [2025-03-09 02:45:22,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:22,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:45:22,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:45:22,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:22,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:22,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910924567] [2025-03-09 02:45:22,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:22,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:22,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:22,770 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:22,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 02:45:22,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:45:22,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:45:22,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:22,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:22,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 02:45:22,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:22,879 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-03-09 02:45:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:45:22,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:45:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456287611] [2025-03-09 02:45:22,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910924567] [2025-03-09 02:45:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910924567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:22,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:45:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757198650] [2025-03-09 02:45:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:22,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:45:22,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:22,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:45:22,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:45:22,987 INFO L87 Difference]: Start difference. First operand 343 states and 465 transitions. Second operand has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:45:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:23,136 INFO L93 Difference]: Finished difference Result 430 states and 501 transitions. [2025-03-09 02:45:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:45:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-09 02:45:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:23,138 INFO L225 Difference]: With dead ends: 430 [2025-03-09 02:45:23,138 INFO L226 Difference]: Without dead ends: 429 [2025-03-09 02:45:23,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:45:23,139 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 253 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:23,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 722 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:45:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-09 02:45:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 343. [2025-03-09 02:45:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 245 states have (on average 1.616326530612245) internal successors, (396), 303 states have internal predecessors, (396), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:45:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 463 transitions. [2025-03-09 02:45:23,159 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 463 transitions. Word has length 47 [2025-03-09 02:45:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:23,159 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 463 transitions. [2025-03-09 02:45:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:45:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 463 transitions. [2025-03-09 02:45:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:45:23,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:23,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:23,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 02:45:23,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 02:45:23,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_33_to_48_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:23,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash 734390513, now seen corresponding path program 1 times [2025-03-09 02:45:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:23,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372491177] [2025-03-09 02:45:23,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:23,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:23,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:45:23,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:45:23,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:23,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372491177] [2025-03-09 02:45:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372491177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:23,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:45:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276288113] [2025-03-09 02:45:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:23,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:45:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:23,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:45:23,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:45:23,999 INFO L87 Difference]: Start difference. First operand 343 states and 463 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:45:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:24,032 INFO L93 Difference]: Finished difference Result 343 states and 463 transitions. [2025-03-09 02:45:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:45:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-09 02:45:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:24,034 INFO L225 Difference]: With dead ends: 343 [2025-03-09 02:45:24,034 INFO L226 Difference]: Without dead ends: 342 [2025-03-09 02:45:24,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:45:24,034 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:24,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:45:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-09 02:45:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-09 02:45:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 302 states have internal predecessors, (394), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:45:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 461 transitions. [2025-03-09 02:45:24,051 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 461 transitions. Word has length 56 [2025-03-09 02:45:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:24,051 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 461 transitions. [2025-03-09 02:45:24,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:45:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 461 transitions. [2025-03-09 02:45:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:45:24,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:24,051 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:24,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:45:24,052 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_33_to_48_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:24,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash 734390097, now seen corresponding path program 1 times [2025-03-09 02:45:24,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:24,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835307385] [2025-03-09 02:45:24,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:24,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:24,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:45:24,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:45:24,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:24,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:24,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:24,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835307385] [2025-03-09 02:45:24,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835307385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:24,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:24,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:45:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042551312] [2025-03-09 02:45:24,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:24,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:45:24,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:24,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:45:24,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:45:24,433 INFO L87 Difference]: Start difference. First operand 342 states and 461 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:45:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:24,466 INFO L93 Difference]: Finished difference Result 342 states and 461 transitions. [2025-03-09 02:45:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:45:24,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-09 02:45:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:24,468 INFO L225 Difference]: With dead ends: 342 [2025-03-09 02:45:24,468 INFO L226 Difference]: Without dead ends: 341 [2025-03-09 02:45:24,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:45:24,468 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:24,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 434 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:45:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-09 02:45:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-09 02:45:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 245 states have (on average 1.6) internal successors, (392), 301 states have internal predecessors, (392), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:45:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 459 transitions. [2025-03-09 02:45:24,485 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 459 transitions. Word has length 56 [2025-03-09 02:45:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:24,485 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 459 transitions. [2025-03-09 02:45:24,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-09 02:45:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 459 transitions. [2025-03-09 02:45:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:45:24,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:24,486 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:24,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:45:24,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_33_to_48_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:24,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1291269415, now seen corresponding path program 1 times [2025-03-09 02:45:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:24,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420483577] [2025-03-09 02:45:24,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:24,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:45:24,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:45:24,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:24,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:45:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420483577] [2025-03-09 02:45:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420483577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:45:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073244699] [2025-03-09 02:45:24,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:24,895 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:24,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 02:45:24,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:45:25,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:45:25,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:25,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:25,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 02:45:25,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:25,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:25,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 02:45:25,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2025-03-09 02:45:25,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:25,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-09 02:45:25,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:25,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:25,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:45:25,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:45:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:45:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073244699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:45:25,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:45:25,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 28 [2025-03-09 02:45:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806551894] [2025-03-09 02:45:25,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:45:25,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 02:45:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:25,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 02:45:25,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:45:25,791 INFO L87 Difference]: Start difference. First operand 341 states and 459 transitions. Second operand has 29 states, 22 states have (on average 5.090909090909091) internal successors, (112), 25 states have internal predecessors, (112), 12 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-09 02:45:29,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:34,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:38,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:42,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:42,521 INFO L93 Difference]: Finished difference Result 398 states and 484 transitions. [2025-03-09 02:45:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 02:45:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 5.090909090909091) internal successors, (112), 25 states have internal predecessors, (112), 12 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) Word has length 57 [2025-03-09 02:45:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:42,523 INFO L225 Difference]: With dead ends: 398 [2025-03-09 02:45:42,523 INFO L226 Difference]: Without dead ends: 397 [2025-03-09 02:45:42,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=1284, Unknown=0, NotChecked=0, Total=1482 [2025-03-09 02:45:42,523 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 642 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 75 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:42,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1715 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 579 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2025-03-09 02:45:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-09 02:45:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 341. [2025-03-09 02:45:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 245 states have (on average 1.5959183673469388) internal successors, (391), 301 states have internal predecessors, (391), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:45:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 458 transitions. [2025-03-09 02:45:42,556 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 458 transitions. Word has length 57 [2025-03-09 02:45:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:42,556 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 458 transitions. [2025-03-09 02:45:42,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 5.090909090909091) internal successors, (112), 25 states have internal predecessors, (112), 12 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-09 02:45:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 458 transitions. [2025-03-09 02:45:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 02:45:42,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:42,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:42,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 02:45:42,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:45:42,758 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_33_to_48_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:42,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1291256506, now seen corresponding path program 1 times [2025-03-09 02:45:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860654838] [2025-03-09 02:45:42,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:42,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:42,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-09 02:45:42,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-09 02:45:42,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 02:45:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860654838] [2025-03-09 02:45:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860654838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:43,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 02:45:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039367139] [2025-03-09 02:45:43,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:43,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:45:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:43,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:45:43,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:45:43,112 INFO L87 Difference]: Start difference. First operand 341 states and 458 transitions. Second operand has 11 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:45:43,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:43,375 INFO L93 Difference]: Finished difference Result 346 states and 463 transitions. [2025-03-09 02:45:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:45:43,375 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-03-09 02:45:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:43,377 INFO L225 Difference]: With dead ends: 346 [2025-03-09 02:45:43,377 INFO L226 Difference]: Without dead ends: 345 [2025-03-09 02:45:43,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-09 02:45:43,377 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 119 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:43,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1199 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:45:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-09 02:45:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2025-03-09 02:45:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 247 states have (on average 1.591093117408907) internal successors, (393), 303 states have internal predecessors, (393), 30 states have call successors, (30), 10 states have call predecessors, (30), 12 states have return successors, (37), 30 states have call predecessors, (37), 30 states have call successors, (37) [2025-03-09 02:45:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 460 transitions. [2025-03-09 02:45:43,398 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 460 transitions. Word has length 57 [2025-03-09 02:45:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:43,398 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 460 transitions. [2025-03-09 02:45:43,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:45:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 460 transitions. [2025-03-09 02:45:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:45:43,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:43,399 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:43,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 02:45:43,399 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:43,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1374438675, now seen corresponding path program 1 times [2025-03-09 02:45:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:43,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790338207] [2025-03-09 02:45:43,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:43,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:45:43,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:45:43,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:43,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790338207] [2025-03-09 02:45:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790338207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:43,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:43,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:45:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650618584] [2025-03-09 02:45:43,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:45:43,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:43,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:45:43,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:45:43,685 INFO L87 Difference]: Start difference. First operand 343 states and 460 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:45:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:43,923 INFO L93 Difference]: Finished difference Result 347 states and 466 transitions. [2025-03-09 02:45:43,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:45:43,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2025-03-09 02:45:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:43,924 INFO L225 Difference]: With dead ends: 347 [2025-03-09 02:45:43,924 INFO L226 Difference]: Without dead ends: 346 [2025-03-09 02:45:43,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:45:43,925 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 45 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:43,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 711 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:45:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-09 02:45:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-03-09 02:45:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 248 states have (on average 1.5806451612903225) internal successors, (392), 305 states have internal predecessors, (392), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-09 02:45:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 464 transitions. [2025-03-09 02:45:43,942 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 464 transitions. Word has length 58 [2025-03-09 02:45:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:43,943 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 464 transitions. [2025-03-09 02:45:43,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:45:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 464 transitions. [2025-03-09 02:45:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:45:43,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:43,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:43,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 02:45:43,943 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_33_to_48_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:43,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:43,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1374646191, now seen corresponding path program 1 times [2025-03-09 02:45:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:43,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117271258] [2025-03-09 02:45:43,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:43,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:45:43,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:45:43,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:43,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:44,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:44,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117271258] [2025-03-09 02:45:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117271258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:44,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:45:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392006871] [2025-03-09 02:45:44,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:44,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:45:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:44,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:45:44,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:45:44,182 INFO L87 Difference]: Start difference. First operand 346 states and 464 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:44,316 INFO L93 Difference]: Finished difference Result 367 states and 474 transitions. [2025-03-09 02:45:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:45:44,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-09 02:45:44,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:44,317 INFO L225 Difference]: With dead ends: 367 [2025-03-09 02:45:44,317 INFO L226 Difference]: Without dead ends: 365 [2025-03-09 02:45:44,318 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-03-09 02:45:44,318 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 72 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:44,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 662 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:45:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-09 02:45:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 350. [2025-03-09 02:45:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5714285714285714) internal successors, (396), 309 states have internal predecessors, (396), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-09 02:45:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 468 transitions. [2025-03-09 02:45:44,336 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 468 transitions. Word has length 58 [2025-03-09 02:45:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:44,337 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 468 transitions. [2025-03-09 02:45:44,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 468 transitions. [2025-03-09 02:45:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:45:44,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:44,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:44,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:45:44,337 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_33_to_48_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:44,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1374245999, now seen corresponding path program 1 times [2025-03-09 02:45:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:44,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139305468] [2025-03-09 02:45:44,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:44,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:45:44,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:45:44,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:44,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:44,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139305468] [2025-03-09 02:45:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139305468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:45:44,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615133328] [2025-03-09 02:45:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:44,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:45:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:44,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:45:44,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:45:44,545 INFO L87 Difference]: Start difference. First operand 350 states and 468 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:44,693 INFO L93 Difference]: Finished difference Result 387 states and 478 transitions. [2025-03-09 02:45:44,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:45:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-09 02:45:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:44,697 INFO L225 Difference]: With dead ends: 387 [2025-03-09 02:45:44,697 INFO L226 Difference]: Without dead ends: 385 [2025-03-09 02:45:44,697 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-03-09 02:45:44,698 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 109 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:44,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 685 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:45:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-09 02:45:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 350. [2025-03-09 02:45:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5634920634920635) internal successors, (394), 309 states have internal predecessors, (394), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-09 02:45:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 466 transitions. [2025-03-09 02:45:44,717 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 466 transitions. Word has length 58 [2025-03-09 02:45:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:44,717 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 466 transitions. [2025-03-09 02:45:44,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 466 transitions. [2025-03-09 02:45:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:45:44,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:44,718 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:44,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:45:44,718 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash -342073925, now seen corresponding path program 1 times [2025-03-09 02:45:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:44,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948665154] [2025-03-09 02:45:44,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:44,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:45:44,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:45:44,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:44,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:44,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:44,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948665154] [2025-03-09 02:45:44,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948665154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:44,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:44,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:45:44,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663102143] [2025-03-09 02:45:44,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:44,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:45:44,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:44,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:45:44,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:45:44,955 INFO L87 Difference]: Start difference. First operand 350 states and 466 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:45:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:45,161 INFO L93 Difference]: Finished difference Result 351 states and 466 transitions. [2025-03-09 02:45:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:45:45,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2025-03-09 02:45:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:45,162 INFO L225 Difference]: With dead ends: 351 [2025-03-09 02:45:45,163 INFO L226 Difference]: Without dead ends: 350 [2025-03-09 02:45:45,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:45:45,163 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:45,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 656 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:45:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-09 02:45:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-03-09 02:45:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5555555555555556) internal successors, (392), 309 states have internal predecessors, (392), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-09 02:45:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 464 transitions. [2025-03-09 02:45:45,183 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 464 transitions. Word has length 59 [2025-03-09 02:45:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:45,183 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 464 transitions. [2025-03-09 02:45:45,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:45:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 464 transitions. [2025-03-09 02:45:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:45:45,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:45,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:45,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:45:45,184 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_33_to_48_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:45,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1814938003, now seen corresponding path program 1 times [2025-03-09 02:45:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376598446] [2025-03-09 02:45:45,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:45,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:45:45,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:45:45,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:45,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376598446] [2025-03-09 02:45:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376598446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:45,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:45,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:45:45,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542346231] [2025-03-09 02:45:45,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:45:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:45,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:45:45,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:45:45,416 INFO L87 Difference]: Start difference. First operand 350 states and 464 transitions. Second operand has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:45,582 INFO L93 Difference]: Finished difference Result 389 states and 484 transitions. [2025-03-09 02:45:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:45:45,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-03-09 02:45:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:45,584 INFO L225 Difference]: With dead ends: 389 [2025-03-09 02:45:45,584 INFO L226 Difference]: Without dead ends: 387 [2025-03-09 02:45:45,584 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-03-09 02:45:45,585 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 104 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:45,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 657 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:45:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-09 02:45:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 350. [2025-03-09 02:45:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5476190476190477) internal successors, (390), 309 states have internal predecessors, (390), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-09 02:45:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 462 transitions. [2025-03-09 02:45:45,615 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 462 transitions. Word has length 60 [2025-03-09 02:45:45,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:45,615 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 462 transitions. [2025-03-09 02:45:45,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 462 transitions. [2025-03-09 02:45:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:45:45,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:45,615 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:45,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 02:45:45,616 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:45,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2095444365, now seen corresponding path program 1 times [2025-03-09 02:45:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:45,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006887733] [2025-03-09 02:45:45,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:45,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:45,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:45:45,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:45:45,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:45,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:45,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:45,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006887733] [2025-03-09 02:45:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006887733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:45:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025773624] [2025-03-09 02:45:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:45,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:45:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:45,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:45:45,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:45:45,795 INFO L87 Difference]: Start difference. First operand 350 states and 462 transitions. Second operand has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:45,917 INFO L93 Difference]: Finished difference Result 366 states and 470 transitions. [2025-03-09 02:45:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:45:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-03-09 02:45:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:45,918 INFO L225 Difference]: With dead ends: 366 [2025-03-09 02:45:45,918 INFO L226 Difference]: Without dead ends: 364 [2025-03-09 02:45:45,918 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-03-09 02:45:45,919 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 69 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:45,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 664 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:45:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-09 02:45:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2025-03-09 02:45:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 256 states have (on average 1.5390625) internal successors, (394), 313 states have internal predecessors, (394), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-09 02:45:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 466 transitions. [2025-03-09 02:45:45,947 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 466 transitions. Word has length 60 [2025-03-09 02:45:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:45,947 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 466 transitions. [2025-03-09 02:45:45,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:45,947 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 466 transitions. [2025-03-09 02:45:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:45:45,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:45,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:45,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 02:45:45,948 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_33_to_48_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:45,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2059495475, now seen corresponding path program 1 times [2025-03-09 02:45:45,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:45,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203472257] [2025-03-09 02:45:45,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:45,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:45:45,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:45:45,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:45,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:45,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47873300] [2025-03-09 02:45:45,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:45,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:45,978 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:45,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 02:45:46,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:45:46,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:45:46,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:46,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:46,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-09 02:45:46,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:46,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:46,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:46,162 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-03-09 02:45:46,508 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 34 treesize of output 11 [2025-03-09 02:45:46,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:46,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:46,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:45:46,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:46,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203472257] [2025-03-09 02:45:46,870 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:46,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47873300] [2025-03-09 02:45:46,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47873300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:45:46,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:45:46,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-09 02:45:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222574911] [2025-03-09 02:45:46,870 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:45:46,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:45:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:46,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:45:46,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:45:46,871 INFO L87 Difference]: Start difference. First operand 354 states and 466 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:51,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:51,157 INFO L93 Difference]: Finished difference Result 418 states and 492 transitions. [2025-03-09 02:45:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:45:51,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-03-09 02:45:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:51,159 INFO L225 Difference]: With dead ends: 418 [2025-03-09 02:45:51,159 INFO L226 Difference]: Without dead ends: 417 [2025-03-09 02:45:51,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:45:51,159 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 214 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:51,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 979 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-09 02:45:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-09 02:45:51,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 354. [2025-03-09 02:45:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 256 states have (on average 1.53515625) internal successors, (393), 313 states have internal predecessors, (393), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-09 02:45:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 465 transitions. [2025-03-09 02:45:51,178 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 465 transitions. Word has length 65 [2025-03-09 02:45:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:51,178 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 465 transitions. [2025-03-09 02:45:51,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 465 transitions. [2025-03-09 02:45:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:45:51,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:51,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:51,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 02:45:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 02:45:51,383 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_33_to_48_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:51,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash -110713056, now seen corresponding path program 1 times [2025-03-09 02:45:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650688283] [2025-03-09 02:45:51,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:51,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:45:51,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:45:51,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:51,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289480782] [2025-03-09 02:45:51,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:51,412 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:51,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 02:45:51,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:45:51,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:45:51,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:51,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:51,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-09 02:45:51,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:51,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:51,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:51,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:51,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:51,916 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 34 treesize of output 11 [2025-03-09 02:45:51,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:51,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:45:51,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:45:52,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650688283] [2025-03-09 02:45:52,205 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289480782] [2025-03-09 02:45:52,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289480782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:45:52,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:45:52,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-09 02:45:52,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155864374] [2025-03-09 02:45:52,205 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:45:52,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:45:52,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:52,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:45:52,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:45:52,206 INFO L87 Difference]: Start difference. First operand 354 states and 465 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:52,593 INFO L93 Difference]: Finished difference Result 427 states and 497 transitions. [2025-03-09 02:45:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:45:52,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-03-09 02:45:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:52,595 INFO L225 Difference]: With dead ends: 427 [2025-03-09 02:45:52,595 INFO L226 Difference]: Without dead ends: 426 [2025-03-09 02:45:52,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:45:52,596 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 237 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:52,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1049 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:45:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-09 02:45:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 354. [2025-03-09 02:45:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 256 states have (on average 1.53125) internal successors, (392), 313 states have internal predecessors, (392), 31 states have call successors, (31), 10 states have call predecessors, (31), 13 states have return successors, (41), 31 states have call predecessors, (41), 31 states have call successors, (41) [2025-03-09 02:45:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 464 transitions. [2025-03-09 02:45:52,616 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 464 transitions. Word has length 65 [2025-03-09 02:45:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:52,616 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 464 transitions. [2025-03-09 02:45:52,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:45:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 464 transitions. [2025-03-09 02:45:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:45:52,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:52,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:52,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 02:45:52,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 02:45:52,821 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_48_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_48_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2025-03-09 02:45:52,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash 673924385, now seen corresponding path program 1 times [2025-03-09 02:45:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:52,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157366571] [2025-03-09 02:45:52,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:52,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:45:52,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:45:52,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:52,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:52,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074911460] [2025-03-09 02:45:52,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:52,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:52,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:52,846 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:52,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 02:45:52,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:45:52,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:45:52,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:52,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:52,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:45:52,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:53,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:53,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:53,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:45:53,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:45:53,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:53,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157366571] [2025-03-09 02:45:53,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:53,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074911460] [2025-03-09 02:45:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074911460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:45:53,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:45:53,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-09 02:45:53,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737031796] [2025-03-09 02:45:53,344 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:45:53,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:45:53,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:53,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:45:53,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:45:53,346 INFO L87 Difference]: Start difference. First operand 354 states and 464 transitions. Second operand has 11 states, 9 states have (on average 5.111111111111111) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-09 02:45:57,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:01,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]