./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_loop-simple/recursified_nested_4.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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:47:26,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:47:26,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:47:26,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:47:26,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:47:26,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:47:26,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:47:26,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:47:26,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:47:26,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:47:26,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:47:26,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:47:26,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:47:26,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:47:26,843 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:47:26,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:47:26,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:47:26,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:47:26,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:47:26,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:47:26,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:47:26,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:47:26,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:47:26,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:47:26,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:47:26,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:47:26,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:47:26,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:47:26,846 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2025-03-17 15:47:27,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:47:27,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:47:27,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:47:27,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:47:27,064 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:47:27,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-03-17 15:47:28,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5dbe710/931dee8717ba447da9a13973abf8f80f/FLAG5df930894 [2025-03-17 15:47:28,412 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:47:28,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-03-17 15:47:28,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5dbe710/931dee8717ba447da9a13973abf8f80f/FLAG5df930894 [2025-03-17 15:47:28,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5dbe710/931dee8717ba447da9a13973abf8f80f [2025-03-17 15:47:28,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:47:28,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:47:28,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:47:28,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:47:28,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:47:28,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfbd647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28, skipping insertion in model container [2025-03-17 15:47:28,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:47:28,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:47:28,858 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:47:28,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:47:28,885 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:47:28,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28 WrapperNode [2025-03-17 15:47:28,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:47:28,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:47:28,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:47:28,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:47:28,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,911 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-03-17 15:47:28,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:47:28,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:47:28,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:47:28,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:47:28,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,935 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2025-03-17 15:47:28,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:47:28,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:47:28,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:47:28,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:47:28,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (1/1) ... [2025-03-17 15:47:28,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:47:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:28,979 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-17 15:47:28,982 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-17 15:47:29,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:47:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-03-17 15:47:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-03-17 15:47:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-03-17 15:47:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2025-03-17 15:47:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:47:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 15:47:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:47:29,075 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:47:29,077 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:47:29,214 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset; [2025-03-17 15:47:29,225 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-17 15:47:29,225 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:47:29,235 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:47:29,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:47:29,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:47:29 BoogieIcfgContainer [2025-03-17 15:47:29,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:47:29,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:47:29,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:47:29,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:47:29,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:47:28" (1/3) ... [2025-03-17 15:47:29,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1cd9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:47:29, skipping insertion in model container [2025-03-17 15:47:29,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:47:28" (2/3) ... [2025-03-17 15:47:29,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1cd9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:47:29, skipping insertion in model container [2025-03-17 15:47:29,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:47:29" (3/3) ... [2025-03-17 15:47:29,241 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2025-03-17 15:47:29,251 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:47:29,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_4.c that has 5 procedures, 55 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-17 15:47:29,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:47:29,298 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;@23e698ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:47:29,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 15:47:29,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:47:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 15:47:29,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:29,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:29,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:29,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1280059673, now seen corresponding path program 1 times [2025-03-17 15:47:29,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:29,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309097575] [2025-03-17 15:47:29,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:29,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:29,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 15:47:29,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 15:47:29,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:29,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:29,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309097575] [2025-03-17 15:47:29,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309097575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:29,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:29,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:47:29,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751169715] [2025-03-17 15:47:29,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:29,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:29,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:29,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:29,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:29,719 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:47:29,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:29,845 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-03-17 15:47:29,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 15:47:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:29,852 INFO L225 Difference]: With dead ends: 70 [2025-03-17 15:47:29,853 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 15:47:29,855 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-17 15:47:29,858 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:29,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 15:47:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 15:47:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 38 states have internal predecessors, (39), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:47:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-03-17 15:47:29,888 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 11 [2025-03-17 15:47:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:29,889 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-03-17 15:47:29,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:47:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-03-17 15:47:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:47:29,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:29,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:29,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:47:29,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:29,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1495313164, now seen corresponding path program 1 times [2025-03-17 15:47:29,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:29,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660795289] [2025-03-17 15:47:29,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:29,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:29,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:47:29,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:47:29,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:29,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:30,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660795289] [2025-03-17 15:47:30,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660795289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:30,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:30,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:47:30,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796934776] [2025-03-17 15:47:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:30,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:30,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:30,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:30,090 INFO L87 Difference]: Start difference. First operand 48 states and 55 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, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:30,151 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2025-03-17 15:47:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:30,151 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, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 15:47:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:30,153 INFO L225 Difference]: With dead ends: 96 [2025-03-17 15:47:30,153 INFO L226 Difference]: Without dead ends: 53 [2025-03-17 15:47:30,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:47:30,154 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 5 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:30,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 203 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-17 15:47:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-03-17 15:47:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 40 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:47:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-17 15:47:30,162 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 14 [2025-03-17 15:47:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:30,162 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-17 15:47:30,162 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, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-17 15:47:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:47:30,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:30,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:30,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:47:30,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:30,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:30,163 INFO L85 PathProgramCache]: Analyzing trace with hash 889932176, now seen corresponding path program 1 times [2025-03-17 15:47:30,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:30,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856682865] [2025-03-17 15:47:30,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:30,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:47:30,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:47:30,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:30,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856682865] [2025-03-17 15:47:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856682865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:30,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:47:30,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468666862] [2025-03-17 15:47:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:30,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:47:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:30,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:47:30,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:47:30,226 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:30,246 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-03-17 15:47:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:47:30,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 15:47:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:30,249 INFO L225 Difference]: With dead ends: 51 [2025-03-17 15:47:30,249 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 15:47:30,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:47:30,250 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:30,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 15:47:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 15:47:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:47:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-17 15:47:30,259 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 15 [2025-03-17 15:47:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:30,259 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-17 15:47:30,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-17 15:47:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:47:30,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:30,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:47:30,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:30,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:30,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1495913532, now seen corresponding path program 1 times [2025-03-17 15:47:30,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835930697] [2025-03-17 15:47:30,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:30,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:47:30,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:47:30,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:30,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:30,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835930697] [2025-03-17 15:47:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835930697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:30,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:47:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294005661] [2025-03-17 15:47:30,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:30,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:30,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:30,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:30,400 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 6 states, 5 states have (on average 2.0) 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:47:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:30,517 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2025-03-17 15:47:30,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:30,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-17 15:47:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:30,520 INFO L225 Difference]: With dead ends: 108 [2025-03-17 15:47:30,520 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 15:47:30,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:47:30,521 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:30,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 107 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 15:47:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2025-03-17 15:47:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 40 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-03-17 15:47:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-03-17 15:47:30,526 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 14 [2025-03-17 15:47:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:30,526 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-03-17 15:47:30,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:47:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-03-17 15:47:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:47:30,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:30,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:30,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:47:30,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1002487890, now seen corresponding path program 1 times [2025-03-17 15:47:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565706633] [2025-03-17 15:47:30,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:30,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:47:30,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:47:30,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:30,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565706633] [2025-03-17 15:47:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565706633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:30,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:30,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:47:30,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550560371] [2025-03-17 15:47:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:30,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:47:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:30,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:47:30,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:47:30,704 INFO L87 Difference]: Start difference. First operand 52 states and 59 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, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:30,762 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-03-17 15:47:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:47:30,762 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, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-17 15:47:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:30,763 INFO L225 Difference]: With dead ends: 58 [2025-03-17 15:47:30,763 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 15:47:30,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:47:30,764 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:30,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 15:47:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-03-17 15:47:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.28125) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-17 15:47:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-03-17 15:47:30,769 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 19 [2025-03-17 15:47:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:30,769 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-03-17 15:47:30,769 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, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-03-17 15:47:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 15:47:30,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:30,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:30,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:47:30,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash 256513989, now seen corresponding path program 1 times [2025-03-17 15:47:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:30,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263619908] [2025-03-17 15:47:30,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:30,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 15:47:30,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 15:47:30,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:47:30,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263619908] [2025-03-17 15:47:30,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263619908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551449916] [2025-03-17 15:47:30,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:30,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:30,902 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-17 15:47:30,903 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-17 15:47:30,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 15:47:30,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 15:47:30,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:30,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:30,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 15:47:30,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:31,009 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-17 15:47:31,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-17 15:47:31,215 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-17 15:47:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:31,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:47:31,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551449916] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:31,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:47:31,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 9] total 19 [2025-03-17 15:47:31,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272103208] [2025-03-17 15:47:31,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:31,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:31,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:31,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:31,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:47:31,326 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:31,393 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-03-17 15:47:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:47:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-17 15:47:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:31,394 INFO L225 Difference]: With dead ends: 53 [2025-03-17 15:47:31,394 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 15:47:31,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:47:31,395 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:31,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 15:47:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-17 15:47:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.25) internal successors, (40), 38 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-17 15:47:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-17 15:47:31,399 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2025-03-17 15:47:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:31,400 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-17 15:47:31,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-17 15:47:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:47:31,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:31,402 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:31,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 15:47:31,606 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,SelfDestructingSolverStorable5 [2025-03-17 15:47:31,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:31,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash -181584147, now seen corresponding path program 1 times [2025-03-17 15:47:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905376993] [2025-03-17 15:47:31,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:31,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:31,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:47:31,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:47:31,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:31,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:31,747 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-17 15:47:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905376993] [2025-03-17 15:47:31,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905376993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:47:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191706604] [2025-03-17 15:47:31,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:31,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:31,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:31,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:31,750 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:31,793 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-03-17 15:47:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:31,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-17 15:47:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:31,794 INFO L225 Difference]: With dead ends: 61 [2025-03-17 15:47:31,794 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 15:47:31,794 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-17 15:47:31,794 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:31,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 189 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 15:47:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 15:47:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-17 15:47:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-03-17 15:47:31,799 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 24 [2025-03-17 15:47:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:31,799 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-03-17 15:47:31,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-03-17 15:47:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 15:47:31,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:31,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:47:31,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:47:31,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:31,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash -638000940, now seen corresponding path program 1 times [2025-03-17 15:47:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:31,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178213398] [2025-03-17 15:47:31,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:31,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:47:31,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:47:31,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:31,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 15:47:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:31,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178213398] [2025-03-17 15:47:31,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178213398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:31,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944739855] [2025-03-17 15:47:31,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:31,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:31,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:31,919 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-17 15:47:31,920 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-17 15:47:31,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:47:31,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:47:31,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:31,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:31,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:47:31,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:32,061 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-17 15:47:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:47:32,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:47:32,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944739855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:32,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:47:32,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-17 15:47:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685651614] [2025-03-17 15:47:32,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:32,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:32,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:32,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:32,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:47:32,072 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:36,116 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-17 15:47:36,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:36,147 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-03-17 15:47:36,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:47:36,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-17 15:47:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:36,148 INFO L225 Difference]: With dead ends: 57 [2025-03-17 15:47:36,148 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 15:47:36,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:47:36,149 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:36,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 15:47:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 15:47:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-03-17 15:47:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 37 states have internal predecessors, (39), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-17 15:47:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-17 15:47:36,159 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 23 [2025-03-17 15:47:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:36,160 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-17 15:47:36,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-17 15:47:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:47:36,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:36,162 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 15:47:36,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:47:36,362 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,SelfDestructingSolverStorable7 [2025-03-17 15:47:36,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:36,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash -571603887, now seen corresponding path program 1 times [2025-03-17 15:47:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163536763] [2025-03-17 15:47:36,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:36,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:47:36,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:47:36,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:36,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:36,474 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-17 15:47:36,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:36,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163536763] [2025-03-17 15:47:36,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163536763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:36,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:36,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:47:36,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330636689] [2025-03-17 15:47:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:36,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:36,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:36,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:36,476 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:47:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:36,527 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-03-17 15:47:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:47:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-17 15:47:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:36,528 INFO L225 Difference]: With dead ends: 64 [2025-03-17 15:47:36,529 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 15:47:36,529 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-17 15:47:36,530 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:36,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 177 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 15:47:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-03-17 15:47:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-17 15:47:36,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-03-17 15:47:36,540 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 34 [2025-03-17 15:47:36,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:36,540 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-03-17 15:47:36,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:47:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-03-17 15:47:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:47:36,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:36,543 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:36,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:47:36,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:36,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1774763897, now seen corresponding path program 1 times [2025-03-17 15:47:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857844925] [2025-03-17 15:47:36,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:36,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:47:36,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:47:36,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:36,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:47:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857844925] [2025-03-17 15:47:36,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857844925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:36,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605304839] [2025-03-17 15:47:36,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:36,872 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-17 15:47:36,876 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-17 15:47:36,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:47:36,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:47:36,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:36,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:36,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 15:47:36,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:36,956 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-17 15:47:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:47:37,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:47:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605304839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:37,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:37,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2025-03-17 15:47:37,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337151754] [2025-03-17 15:47:37,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:37,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 15:47:37,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:37,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 15:47:37,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:47:37,442 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 21 states have internal predecessors, (49), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-17 15:47:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:37,692 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2025-03-17 15:47:37,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:47:37,693 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 21 states have internal predecessors, (49), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 42 [2025-03-17 15:47:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:37,693 INFO L225 Difference]: With dead ends: 124 [2025-03-17 15:47:37,693 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 15:47:37,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:47:37,694 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:37,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 368 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:47:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 15:47:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-17 15:47:37,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 46 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:47:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-03-17 15:47:37,706 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 42 [2025-03-17 15:47:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:37,706 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-03-17 15:47:37,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 21 states have internal predecessors, (49), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-17 15:47:37,706 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-03-17 15:47:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 15:47:37,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:37,709 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:37,714 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-17 15:47:37,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:37,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 215855239, now seen corresponding path program 2 times [2025-03-17 15:47:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071218767] [2025-03-17 15:47:37,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:37,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-17 15:47:37,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 15:47:37,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:37,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-17 15:47:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:38,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071218767] [2025-03-17 15:47:38,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071218767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:38,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903745429] [2025-03-17 15:47:38,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:38,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:38,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:38,139 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-17 15:47:38,141 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-17 15:47:38,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-17 15:47:38,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 15:47:38,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:38,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:38,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-17 15:47:38,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:38,237 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-17 15:47:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-17 15:47:38,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 3 proven. 124 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 15:47:39,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903745429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:39,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:39,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 21] total 38 [2025-03-17 15:47:39,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612487238] [2025-03-17 15:47:39,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:39,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 15:47:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:39,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 15:47:39,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 15:47:39,675 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 38 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 11 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-17 15:47:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:40,218 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2025-03-17 15:47:40,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 15:47:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 11 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) Word has length 70 [2025-03-17 15:47:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:40,219 INFO L225 Difference]: With dead ends: 134 [2025-03-17 15:47:40,219 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 15:47:40,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=373, Invalid=2279, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 15:47:40,220 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:40,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 448 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:47:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 15:47:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-03-17 15:47:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 10 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-17 15:47:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-03-17 15:47:40,227 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 70 [2025-03-17 15:47:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:40,227 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-03-17 15:47:40,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 11 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-17 15:47:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-03-17 15:47:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:47:40,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:40,229 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:40,235 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-17 15:47:40,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:40,434 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:40,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1815423504, now seen corresponding path program 1 times [2025-03-17 15:47:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:40,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115806046] [2025-03-17 15:47:40,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:40,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:40,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:47:40,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:47:40,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:40,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-17 15:47:40,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:40,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115806046] [2025-03-17 15:47:40,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115806046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:40,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:40,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:47:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796306424] [2025-03-17 15:47:40,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:40,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:47:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:40,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:47:40,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:47:40,514 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:47:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:40,539 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-03-17 15:47:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:47:40,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 85 [2025-03-17 15:47:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:40,541 INFO L225 Difference]: With dead ends: 65 [2025-03-17 15:47:40,541 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 15:47:40,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:40,541 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:40,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 138 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 15:47:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2025-03-17 15:47:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 42 states have internal predecessors, (45), 9 states have call successors, (9), 7 states have call predecessors, (9), 10 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-17 15:47:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-03-17 15:47:40,551 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 85 [2025-03-17 15:47:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:40,551 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-03-17 15:47:40,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:47:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-03-17 15:47:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 15:47:40,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:40,551 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:40,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:47:40,552 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:40,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2053019666, now seen corresponding path program 1 times [2025-03-17 15:47:40,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:40,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638571932] [2025-03-17 15:47:40,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:40,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:40,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 15:47:40,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 15:47:40,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:40,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-17 15:47:40,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638571932] [2025-03-17 15:47:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638571932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762250] [2025-03-17 15:47:40,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:40,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:40,813 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-17 15:47:40,814 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-17 15:47:40,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 15:47:40,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 15:47:40,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:40,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:40,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 15:47:40,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:40,945 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-17 15:47:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-17 15:47:41,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-17 15:47:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:41,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 26 [2025-03-17 15:47:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645105622] [2025-03-17 15:47:41,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:41,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 15:47:41,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:41,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 15:47:41,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-17 15:47:41,536 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 26 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-17 15:47:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:41,961 INFO L93 Difference]: Finished difference Result 126 states and 152 transitions. [2025-03-17 15:47:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 15:47:41,961 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 107 [2025-03-17 15:47:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:41,962 INFO L225 Difference]: With dead ends: 126 [2025-03-17 15:47:41,962 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 15:47:41,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 15:47:41,963 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 67 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:41,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 197 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:47:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 15:47:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2025-03-17 15:47:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 9 states have call successors, (9), 7 states have call predecessors, (9), 11 states have return successors, (15), 11 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-17 15:47:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2025-03-17 15:47:41,969 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 107 [2025-03-17 15:47:41,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:41,969 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2025-03-17 15:47:41,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-17 15:47:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2025-03-17 15:47:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 15:47:41,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:41,970 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:41,976 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-17 15:47:42,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 15:47:42,171 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-17 15:47:42,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash 755592234, now seen corresponding path program 1 times [2025-03-17 15:47:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125069624] [2025-03-17 15:47:42,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:42,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 15:47:42,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 15:47:42,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:42,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2025-03-17 15:47:42,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:42,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125069624] [2025-03-17 15:47:42,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125069624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:42,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:42,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:47:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694040642] [2025-03-17 15:47:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:47:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:42,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:47:42,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:47:42,269 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:47:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:42,297 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-03-17 15:47:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:47:42,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2025-03-17 15:47:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:42,299 INFO L225 Difference]: With dead ends: 61 [2025-03-17 15:47:42,299 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:47:42,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:42,299 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:42,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:47:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:47:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:47:42,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2025-03-17 15:47:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:42,300 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:47:42,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:47:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:47:42,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:47:42,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 15:47:42,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 15:47:42,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 15:47:42,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 15:47:42,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 15:47:42,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 15:47:42,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 15:47:42,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 15:47:42,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:47:42,309 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:42,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:47:43,011 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:47:43,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:47:43 BoogieIcfgContainer [2025-03-17 15:47:43,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:47:43,016 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:47:43,016 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:47:43,016 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:47:43,016 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:47:29" (3/4) ... [2025-03-17 15:47:43,018 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:47:43,021 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_24_to_25_0 [2025-03-17 15:47:43,021 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_23_to_24_0 [2025-03-17 15:47:43,022 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_22_to_23_0 [2025-03-17 15:47:43,022 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_25_to_25_0 [2025-03-17 15:47:43,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-17 15:47:43,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 15:47:43,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:47:43,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:47:43,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:47:43,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:47:43,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:47:43,085 INFO L158 Benchmark]: Toolchain (without parser) took 14353.30ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.9MB in the beginning and 185.9MB in the end (delta: -80.0MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2025-03-17 15:47:43,086 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:47:43,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.74ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:47:43,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.29ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.7MB in the end (delta: 723.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:47:43,086 INFO L158 Benchmark]: Boogie Preprocessor took 37.88ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:47:43,086 INFO L158 Benchmark]: IcfgBuilder took 283.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 74.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:47:43,086 INFO L158 Benchmark]: TraceAbstraction took 13778.69ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.8MB in the beginning and 194.1MB in the end (delta: -119.3MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. [2025-03-17 15:47:43,086 INFO L158 Benchmark]: Witness Printer took 69.10ms. Allocated memory is still 302.0MB. Free memory was 194.1MB in the beginning and 185.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:47:43,087 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.74ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.29ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 93.7MB in the end (delta: 723.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.88ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 283.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 74.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13778.69ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 74.8MB in the beginning and 194.1MB in the end (delta: -119.3MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. * Witness Printer took 69.10ms. Allocated memory is still 302.0MB. Free memory was 194.1MB in the beginning and 185.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 55 locations, 74 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 14, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 287 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 284 mSDsluCounter, 2860 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2315 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1864 IncrementalHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 545 mSDtfsCounter, 1864 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 445 SyntacticMatches, 3 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=11, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 51 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 934 NumberOfCodeBlocks, 934 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1152 ConstructedInterpolants, 12 QuantifiedInterpolants, 3398 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1738 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 2803/3024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 15:47:43,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE