./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.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_nla-digbench/recursified_sqrt1.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 b23f88f1df76f11fbfc8e6288f4ade0e00ecdc2b8889a67f3774db6dfccf1d90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:49:38,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:49:38,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:49:38,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:49:38,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:49:38,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:49:38,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:49:38,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:49:38,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:49:38,618 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:49:38,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:49:38,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:49:38,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:49:38,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:49:38,619 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:49:38,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:49:38,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:49:38,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:49:38,620 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:49:38,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:49:38,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:49:38,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:49:38,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:49:38,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:49:38,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:49:38,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:49:38,621 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 -> b23f88f1df76f11fbfc8e6288f4ade0e00ecdc2b8889a67f3774db6dfccf1d90 [2025-03-17 15:49:38,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:49:38,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:49:38,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:49:38,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:49:38,855 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:49:38,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c [2025-03-17 15:49:39,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2fd1920/c5e1045a2adc4d59b13d70f317102b39/FLAG5677807a7 [2025-03-17 15:49:40,194 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:49:40,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c [2025-03-17 15:49:40,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2fd1920/c5e1045a2adc4d59b13d70f317102b39/FLAG5677807a7 [2025-03-17 15:49:40,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2fd1920/c5e1045a2adc4d59b13d70f317102b39 [2025-03-17 15:49:40,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:49:40,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:49:40,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:49:40,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:49:40,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:49:40,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14674791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40, skipping insertion in model container [2025-03-17 15:49:40,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:49:40,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:49:40,373 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:49:40,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:49:40,406 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:49:40,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40 WrapperNode [2025-03-17 15:49:40,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:49:40,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:49:40,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:49:40,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:49:40,413 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:49:40" (1/1) ... [2025-03-17 15:49:40,419 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:49:40" (1/1) ... [2025-03-17 15:49:40,439 INFO L138 Inliner]: procedures = 16, calls = 67, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2025-03-17 15:49:40,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:49:40,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:49:40,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:49:40,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:49:40,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,472 INFO L175 MemorySlicer]: Split 41 memory accesses to 6 slices as follows [2, 9, 8, 12, 8, 2]. 29 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 2, 2, 1]. [2025-03-17 15:49:40,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:49:40,484 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:49:40,484 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:49:40,484 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:49:40,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (1/1) ... [2025-03-17 15:49:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:49:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:40,508 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:49:40,511 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:49:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_39_0 [2025-03-17 15:49:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_39_0 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:49:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:49:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:49:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:49:40,605 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:49:40,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:49:40,883 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L76: call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;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_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset;call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset);havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-17 15:49:40,899 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-17 15:49:40,900 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:49:40,909 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:49:40,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:49:40,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:49:40 BoogieIcfgContainer [2025-03-17 15:49:40,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:49:40,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:49:40,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:49:40,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:49:40,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:49:40" (1/3) ... [2025-03-17 15:49:40,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d7f18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:49:40, skipping insertion in model container [2025-03-17 15:49:40,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:40" (2/3) ... [2025-03-17 15:49:40,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d7f18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:49:40, skipping insertion in model container [2025-03-17 15:49:40,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:49:40" (3/3) ... [2025-03-17 15:49:40,918 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_sqrt1.c [2025-03-17 15:49:40,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:49:40,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_sqrt1.c that has 3 procedures, 128 locations, 1 initial locations, 0 loop locations, and 50 error locations. [2025-03-17 15:49:40,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:49:40,965 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;@4cdbcea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:49:40,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-17 15:49:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 67 states have (on average 1.791044776119403) internal successors, (120), 118 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:49:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:49:40,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:40,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:49:40,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_28_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:40,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash 149410735, now seen corresponding path program 1 times [2025-03-17 15:49:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:40,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507149668] [2025-03-17 15:49:40,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:40,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:41,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:49:41,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:49:41,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:41,388 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:49:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:41,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507149668] [2025-03-17 15:49:41,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507149668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:41,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:41,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724897921] [2025-03-17 15:49:41,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:41,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:41,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:41,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:41,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:41,410 INFO L87 Difference]: Start difference. First operand has 128 states, 67 states have (on average 1.791044776119403) internal successors, (120), 118 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 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 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:41,581 INFO L93 Difference]: Finished difference Result 324 states and 361 transitions. [2025-03-17 15:49:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:41,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 15:49:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:41,587 INFO L225 Difference]: With dead ends: 324 [2025-03-17 15:49:41,587 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 15:49:41,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:41,591 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 118 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:41,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 578 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 15:49:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 156. [2025-03-17 15:49:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.7419354838709677) internal successors, (162), 143 states have internal predecessors, (162), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 15:49:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2025-03-17 15:49:41,628 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 5 [2025-03-17 15:49:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:41,628 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2025-03-17 15:49:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2025-03-17 15:49:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:49:41,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:41,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:41,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:49:41,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_28_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:41,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash -746743103, now seen corresponding path program 1 times [2025-03-17 15:49:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800520123] [2025-03-17 15:49:41,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:41,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:49:41,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:49:41,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:41,815 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:49:41,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:41,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800520123] [2025-03-17 15:49:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800520123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:41,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:41,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813271536] [2025-03-17 15:49:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:41,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:41,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:41,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:41,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:41,817 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (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:49:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:41,924 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2025-03-17 15:49:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (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 15 [2025-03-17 15:49:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:41,926 INFO L225 Difference]: With dead ends: 193 [2025-03-17 15:49:41,926 INFO L226 Difference]: Without dead ends: 191 [2025-03-17 15:49:41,926 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:49:41,927 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 113 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:41,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 548 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-17 15:49:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 156. [2025-03-17 15:49:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 143 states have internal predecessors, (160), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 15:49:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2025-03-17 15:49:41,943 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 15 [2025-03-17 15:49:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:41,943 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2025-03-17 15:49:41,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (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:49:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2025-03-17 15:49:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 15:49:41,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:41,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:41,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:49:41,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_28_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:41,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:41,947 INFO L85 PathProgramCache]: Analyzing trace with hash -360582817, now seen corresponding path program 1 times [2025-03-17 15:49:41,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:41,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302909570] [2025-03-17 15:49:41,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:41,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 15:49:41,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 15:49:41,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:42,117 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:49:42,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302909570] [2025-03-17 15:49:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302909570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:42,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:42,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248895890] [2025-03-17 15:49:42,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:42,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:42,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:42,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:42,118 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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:49:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:42,225 INFO L93 Difference]: Finished difference Result 191 states and 201 transitions. [2025-03-17 15:49:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2025-03-17 15:49:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:42,226 INFO L225 Difference]: With dead ends: 191 [2025-03-17 15:49:42,226 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 15:49:42,227 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:49:42,227 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:42,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 545 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 15:49:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2025-03-17 15:49:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 93 states have (on average 1.6989247311827957) internal successors, (158), 143 states have internal predecessors, (158), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-17 15:49:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 179 transitions. [2025-03-17 15:49:42,234 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 179 transitions. Word has length 17 [2025-03-17 15:49:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:42,235 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 179 transitions. [2025-03-17 15:49:42,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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:49:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 179 transitions. [2025-03-17 15:49:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:49:42,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:42,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:49:42,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_28_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:42,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1372264445, now seen corresponding path program 1 times [2025-03-17 15:49:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:42,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467151531] [2025-03-17 15:49:42,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:42,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:49:42,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:49:42,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:42,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:42,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046214929] [2025-03-17 15:49:42,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:42,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:42,265 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:49:42,267 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:49:42,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:49:42,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:49:42,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:42,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:42,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 15:49:42,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:42,362 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:49:42,366 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:49:42,496 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:49:42,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467151531] [2025-03-17 15:49:42,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046214929] [2025-03-17 15:49:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046214929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:42,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:49:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584546659] [2025-03-17 15:49:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:42,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:49:42,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:42,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:49:42,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:49:42,499 INFO L87 Difference]: Start difference. First operand 156 states and 179 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:49:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:42,657 INFO L93 Difference]: Finished difference Result 227 states and 236 transitions. [2025-03-17 15:49:42,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:49:42,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 19 [2025-03-17 15:49:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:42,658 INFO L225 Difference]: With dead ends: 227 [2025-03-17 15:49:42,658 INFO L226 Difference]: Without dead ends: 225 [2025-03-17 15:49:42,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:49:42,659 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 234 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:42,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 516 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-17 15:49:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 174. [2025-03-17 15:49:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6759259259259258) internal successors, (181), 158 states have internal predecessors, (181), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:49:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2025-03-17 15:49:42,667 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 19 [2025-03-17 15:49:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:42,667 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2025-03-17 15:49:42,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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:49:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2025-03-17 15:49:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 15:49:42,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:42,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:42,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:49:42,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:42,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_28_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:42,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1305270597, now seen corresponding path program 1 times [2025-03-17 15:49:42,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:42,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777896324] [2025-03-17 15:49:42,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:42,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:42,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 15:49:42,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 15:49:42,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:42,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:42,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818929080] [2025-03-17 15:49:42,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:42,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:42,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:42,914 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:49:42,915 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:49:42,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 15:49:42,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 15:49:42,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:42,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:42,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 15:49:42,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:42,988 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:49:43,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 15:49:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:43,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:49:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777896324] [2025-03-17 15:49:43,229 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818929080] [2025-03-17 15:49:43,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818929080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:49:43,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:49:43,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-17 15:49:43,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332751625] [2025-03-17 15:49:43,229 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:49:43,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:49:43,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:43,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:49:43,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:49:43,230 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:47,484 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:49:51,583 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:49:55,588 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:49:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:55,609 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2025-03-17 15:49:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 15:49:55,610 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-17 15:49:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:55,611 INFO L225 Difference]: With dead ends: 229 [2025-03-17 15:49:55,611 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 15:49:55,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:49:55,612 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 204 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:55,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 918 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 353 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-03-17 15:49:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 15:49:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 174. [2025-03-17 15:49:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6666666666666667) internal successors, (180), 158 states have internal predecessors, (180), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:49:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 205 transitions. [2025-03-17 15:49:55,625 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 205 transitions. Word has length 27 [2025-03-17 15:49:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:55,627 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 205 transitions. [2025-03-17 15:49:55,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:55,627 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 205 transitions. [2025-03-17 15:49:55,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 15:49:55,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:55,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:55,635 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:49:55,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:55,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_28_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:55,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1808682834, now seen corresponding path program 1 times [2025-03-17 15:49:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666925494] [2025-03-17 15:49:55,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:55,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:49:55,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:49:55,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:55,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845868629] [2025-03-17 15:49:55,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:55,854 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:49:55,856 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:49:55,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:49:55,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:49:55,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:55,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:55,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 15:49:55,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:55,922 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:49:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:56,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:49:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666925494] [2025-03-17 15:49:56,199 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845868629] [2025-03-17 15:49:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845868629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:49:56,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:49:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-17 15:49:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277790933] [2025-03-17 15:49:56,200 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:49:56,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 15:49:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 15:49:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 15:49:56,200 INFO L87 Difference]: Start difference. First operand 174 states and 205 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:56,655 INFO L93 Difference]: Finished difference Result 228 states and 237 transitions. [2025-03-17 15:49:56,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:49:56,656 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-17 15:49:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:56,657 INFO L225 Difference]: With dead ends: 228 [2025-03-17 15:49:56,657 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 15:49:56,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:49:56,658 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 197 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:56,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1030 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 15:49:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 174. [2025-03-17 15:49:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6574074074074074) internal successors, (179), 158 states have internal predecessors, (179), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:49:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 204 transitions. [2025-03-17 15:49:56,667 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 204 transitions. Word has length 28 [2025-03-17 15:49:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:56,667 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 204 transitions. [2025-03-17 15:49:56,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 204 transitions. [2025-03-17 15:49:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:49:56,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:56,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:56,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 15:49:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:56,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_28_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:56,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash -234592999, now seen corresponding path program 1 times [2025-03-17 15:49:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973616255] [2025-03-17 15:49:56,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:56,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:49:56,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:49:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:56,996 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:49:56,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:56,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973616255] [2025-03-17 15:49:56,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973616255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:56,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:56,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:56,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482465014] [2025-03-17 15:49:56,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:56,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:56,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:56,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:56,998 INFO L87 Difference]: Start difference. First operand 174 states and 204 transitions. Second operand has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:49:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:57,113 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2025-03-17 15:49:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-17 15:49:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:57,114 INFO L225 Difference]: With dead ends: 211 [2025-03-17 15:49:57,114 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 15:49:57,115 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:49:57,115 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 121 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:57,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 522 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 15:49:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2025-03-17 15:49:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 158 states have internal predecessors, (177), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:49:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2025-03-17 15:49:57,122 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 29 [2025-03-17 15:49:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:57,122 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2025-03-17 15:49:57,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:49:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2025-03-17 15:49:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:49:57,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:57,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:57,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:49:57,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_28_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:57,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2105572489, now seen corresponding path program 1 times [2025-03-17 15:49:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316098710] [2025-03-17 15:49:57,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:57,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:49:57,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:49:57,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:57,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213812288] [2025-03-17 15:49:57,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:57,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:57,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:57,146 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:49:57,148 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:49:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:49:57,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:49:57,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:57,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:57,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-17 15:49:57,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:57,213 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:49:57,216 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:49:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:57,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:49:57,741 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 38 treesize of output 26 [2025-03-17 15:49:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:49:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316098710] [2025-03-17 15:49:57,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213812288] [2025-03-17 15:49:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213812288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:49:57,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:49:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 21 [2025-03-17 15:49:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488881414] [2025-03-17 15:49:57,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:49:57,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 15:49:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:57,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 15:49:57,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:49:57,819 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 15:49:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:58,603 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2025-03-17 15:49:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:49:58,603 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2025-03-17 15:49:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:58,604 INFO L225 Difference]: With dead ends: 229 [2025-03-17 15:49:58,604 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 15:49:58,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 15:49:58,605 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 340 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:58,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 906 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:49:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 15:49:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 174. [2025-03-17 15:49:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6203703703703705) internal successors, (175), 158 states have internal predecessors, (175), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:49:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 200 transitions. [2025-03-17 15:49:58,612 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 200 transitions. Word has length 31 [2025-03-17 15:49:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:58,612 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 200 transitions. [2025-03-17 15:49:58,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 15:49:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 200 transitions. [2025-03-17 15:49:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 15:49:58,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:58,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:58,620 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:49:58,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:58,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_28_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:58,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash -525565483, now seen corresponding path program 1 times [2025-03-17 15:49:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:58,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645209621] [2025-03-17 15:49:58,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:58,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:58,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 15:49:58,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 15:49:58,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:58,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:58,949 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:49:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645209621] [2025-03-17 15:49:58,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645209621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:58,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:58,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:58,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637752355] [2025-03-17 15:49:58,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:58,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:58,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:58,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:58,950 INFO L87 Difference]: Start difference. First operand 174 states and 200 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:49:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:59,057 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2025-03-17 15:49:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-17 15:49:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:59,059 INFO L225 Difference]: With dead ends: 211 [2025-03-17 15:49:59,059 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 15:49:59,059 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:49:59,059 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 103 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:59,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 528 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 15:49:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2025-03-17 15:49:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.6018518518518519) internal successors, (173), 158 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:49:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 198 transitions. [2025-03-17 15:49:59,069 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 198 transitions. Word has length 33 [2025-03-17 15:49:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:59,069 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 198 transitions. [2025-03-17 15:49:59,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:49:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2025-03-17 15:49:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:49:59,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:59,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:59,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:49:59,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_28_to_39_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:59,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1737711667, now seen corresponding path program 1 times [2025-03-17 15:49:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901011528] [2025-03-17 15:49:59,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:59,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:49:59,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:49:59,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:59,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:59,218 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:49:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901011528] [2025-03-17 15:49:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901011528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:59,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:59,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:59,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912228087] [2025-03-17 15:49:59,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:59,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:59,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:59,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:59,221 INFO L87 Difference]: Start difference. First operand 174 states and 198 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:49:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:59,360 INFO L93 Difference]: Finished difference Result 209 states and 219 transitions. [2025-03-17 15:49:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-17 15:49:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:59,362 INFO L225 Difference]: With dead ends: 209 [2025-03-17 15:49:59,362 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 15:49:59,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:59,362 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:59,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 541 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 15:49:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 174. [2025-03-17 15:49:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.5833333333333333) internal successors, (171), 158 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:49:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2025-03-17 15:49:59,370 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 35 [2025-03-17 15:49:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:59,371 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2025-03-17 15:49:59,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:49:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2025-03-17 15:49:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 15:49:59,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:59,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:59,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:49:59,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_28_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:59,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1965513178, now seen corresponding path program 1 times [2025-03-17 15:49:59,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:59,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583052917] [2025-03-17 15:49:59,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:59,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:59,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:49:59,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:49:59,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:59,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:59,580 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:49:59,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:59,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583052917] [2025-03-17 15:49:59,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583052917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:59,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:59,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:59,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458172428] [2025-03-17 15:49:59,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:59,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:59,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:59,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:59,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:59,582 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:49:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:59,833 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2025-03-17 15:49:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:59,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-03-17 15:49:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:59,834 INFO L225 Difference]: With dead ends: 199 [2025-03-17 15:49:59,834 INFO L226 Difference]: Without dead ends: 197 [2025-03-17 15:49:59,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:59,835 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 95 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:59,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 579 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-17 15:49:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 174. [2025-03-17 15:49:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 158 states have internal predecessors, (169), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:49:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 194 transitions. [2025-03-17 15:49:59,841 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 194 transitions. Word has length 36 [2025-03-17 15:49:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:59,841 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 194 transitions. [2025-03-17 15:49:59,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:49:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 194 transitions. [2025-03-17 15:49:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 15:49:59,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:59,842 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:59,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:49:59,842 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_28_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:49:59,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:59,842 INFO L85 PathProgramCache]: Analyzing trace with hash -649731257, now seen corresponding path program 1 times [2025-03-17 15:49:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:59,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373726603] [2025-03-17 15:49:59,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:59,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 15:49:59,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 15:49:59,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:59,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:49:59,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:59,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373726603] [2025-03-17 15:49:59,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373726603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:59,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:59,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470189911] [2025-03-17 15:49:59,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:59,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:59,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:59,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:59,958 INFO L87 Difference]: Start difference. First operand 174 states and 194 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:50:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:00,028 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2025-03-17 15:50:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:00,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-17 15:50:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:00,030 INFO L225 Difference]: With dead ends: 184 [2025-03-17 15:50:00,030 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 15:50:00,030 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:50:00,030 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 49 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:00,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 561 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 15:50:00,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 176. [2025-03-17 15:50:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 110 states have (on average 1.5545454545454545) internal successors, (171), 160 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:50:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2025-03-17 15:50:00,044 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 46 [2025-03-17 15:50:00,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:00,044 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2025-03-17 15:50:00,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:50:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2025-03-17 15:50:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 15:50:00,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:00,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:50:00,045 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_28_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:00,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1621480731, now seen corresponding path program 1 times [2025-03-17 15:50:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995441589] [2025-03-17 15:50:00,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:00,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 15:50:00,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 15:50:00,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:00,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995441589] [2025-03-17 15:50:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995441589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:00,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:00,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983565886] [2025-03-17 15:50:00,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:00,154 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:50:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:00,230 INFO L93 Difference]: Finished difference Result 203 states and 213 transitions. [2025-03-17 15:50:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:00,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-17 15:50:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:00,231 INFO L225 Difference]: With dead ends: 203 [2025-03-17 15:50:00,231 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 15:50:00,232 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:50:00,232 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 72 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:00,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 556 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 15:50:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 178. [2025-03-17 15:50:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 112 states have (on average 1.5446428571428572) internal successors, (173), 162 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-17 15:50:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2025-03-17 15:50:00,241 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 48 [2025-03-17 15:50:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:00,241 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2025-03-17 15:50:00,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:50:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2025-03-17 15:50:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:50:00,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:00,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:50:00,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:00,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1273751855, now seen corresponding path program 1 times [2025-03-17 15:50:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:00,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743046285] [2025-03-17 15:50:00,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:00,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:50:00,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:50:00,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:00,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:00,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743046285] [2025-03-17 15:50:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743046285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:00,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:00,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837234219] [2025-03-17 15:50:00,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:00,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:00,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:00,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:00,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:00,319 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:50:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:00,395 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2025-03-17 15:50:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:00,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2025-03-17 15:50:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:00,396 INFO L225 Difference]: With dead ends: 186 [2025-03-17 15:50:00,396 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 15:50:00,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:00,397 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 42 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:00,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 362 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 15:50:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2025-03-17 15:50:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 163 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-17 15:50:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2025-03-17 15:50:00,403 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 49 [2025-03-17 15:50:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:00,403 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2025-03-17 15:50:00,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:50:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2025-03-17 15:50:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 15:50:00,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:00,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:50:00,407 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:00,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash 830145155, now seen corresponding path program 1 times [2025-03-17 15:50:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237146559] [2025-03-17 15:50:00,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:00,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 15:50:00,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 15:50:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:00,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237146559] [2025-03-17 15:50:00,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237146559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:00,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:00,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:00,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163527837] [2025-03-17 15:50:00,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:00,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:50:00,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:00,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:50:00,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:00,651 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:50:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:00,778 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2025-03-17 15:50:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:50:00,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-17 15:50:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:00,779 INFO L225 Difference]: With dead ends: 194 [2025-03-17 15:50:00,779 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 15:50:00,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:00,780 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 60 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:00,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 615 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 15:50:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2025-03-17 15:50:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 114 states have (on average 1.5) internal successors, (171), 164 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-17 15:50:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2025-03-17 15:50:00,785 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 50 [2025-03-17 15:50:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:00,785 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2025-03-17 15:50:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:50:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2025-03-17 15:50:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 15:50:00,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:00,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:00,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:50:00,786 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:00,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash -35304000, now seen corresponding path program 1 times [2025-03-17 15:50:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038620702] [2025-03-17 15:50:00,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:00,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:50:00,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:50:00,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:00,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:01,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038620702] [2025-03-17 15:50:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038620702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:01,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019806766] [2025-03-17 15:50:01,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:01,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:50:01,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:01,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:50:01,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:01,031 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:50:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:01,157 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2025-03-17 15:50:01,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:50:01,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-17 15:50:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:01,158 INFO L225 Difference]: With dead ends: 194 [2025-03-17 15:50:01,158 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 15:50:01,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:01,158 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 59 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:01,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 620 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 15:50:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2025-03-17 15:50:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 165 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-17 15:50:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2025-03-17 15:50:01,164 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 51 [2025-03-17 15:50:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:01,165 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2025-03-17 15:50:01,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:50:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2025-03-17 15:50:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:50:01,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:01,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:01,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 15:50:01,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_28_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:01,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash -885562721, now seen corresponding path program 1 times [2025-03-17 15:50:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793982613] [2025-03-17 15:50:01,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:01,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:50:01,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:50:01,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:01,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:01,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:01,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793982613] [2025-03-17 15:50:01,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793982613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:01,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206276556] [2025-03-17 15:50:01,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:01,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:01,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:01,385 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:50:01,387 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:50:01,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:50:01,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:50:01,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:01,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 15:50:01,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:01,472 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:50:01,621 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:50:01,635 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:50:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:01,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206276556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:50:01,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:50:01,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 17 [2025-03-17 15:50:01,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562543023] [2025-03-17 15:50:01,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:01,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 15:50:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:01,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 15:50:01,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:50:01,761 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 15:50:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:02,108 INFO L93 Difference]: Finished difference Result 274 states and 292 transitions. [2025-03-17 15:50:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:50:02,109 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2025-03-17 15:50:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:02,110 INFO L225 Difference]: With dead ends: 274 [2025-03-17 15:50:02,110 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 15:50:02,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-03-17 15:50:02,110 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 421 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:02,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1345 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 15:50:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 217. [2025-03-17 15:50:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 146 states have (on average 1.5136986301369864) internal successors, (221), 194 states have internal predecessors, (221), 16 states have call successors, (16), 5 states have call predecessors, (16), 8 states have return successors, (22), 17 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-17 15:50:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 259 transitions. [2025-03-17 15:50:02,121 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 259 transitions. Word has length 55 [2025-03-17 15:50:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:02,121 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 259 transitions. [2025-03-17 15:50:02,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 6 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 15:50:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 259 transitions. [2025-03-17 15:50:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 15:50:02,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:02,122 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:02,129 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:50:02,322 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,SelfDestructingSolverStorable16 [2025-03-17 15:50:02,322 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_28_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:02,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1682640542, now seen corresponding path program 1 times [2025-03-17 15:50:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:02,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142799750] [2025-03-17 15:50:02,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:02,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 15:50:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 15:50:02,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:02,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:02,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:02,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142799750] [2025-03-17 15:50:02,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142799750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750837647] [2025-03-17 15:50:02,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:02,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:02,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:02,526 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:02,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:50:02,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 15:50:02,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 15:50:02,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:02,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:02,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 15:50:02,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:02,616 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:50:02,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 15:50:02,844 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 36 treesize of output 13 [2025-03-17 15:50:02,854 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:50:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:50:02,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:03,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-17 15:50:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:50:03,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750837647] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:50:03,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:50:03,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 28 [2025-03-17 15:50:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757255571] [2025-03-17 15:50:03,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:03,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 15:50:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:03,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 15:50:03,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:50:03,115 INFO L87 Difference]: Start difference. First operand 217 states and 259 transitions. Second operand has 29 states, 25 states have (on average 4.84) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:50:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:03,684 INFO L93 Difference]: Finished difference Result 335 states and 358 transitions. [2025-03-17 15:50:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:50:03,684 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.84) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) Word has length 56 [2025-03-17 15:50:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:03,686 INFO L225 Difference]: With dead ends: 335 [2025-03-17 15:50:03,686 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 15:50:03,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 15:50:03,686 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 604 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:03,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1707 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:50:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 15:50:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 258. [2025-03-17 15:50:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 182 states have (on average 1.521978021978022) internal successors, (277), 230 states have internal predecessors, (277), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 325 transitions. [2025-03-17 15:50:03,695 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 325 transitions. Word has length 56 [2025-03-17 15:50:03,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:03,695 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 325 transitions. [2025-03-17 15:50:03,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.84) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (14), 7 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-17 15:50:03,695 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 325 transitions. [2025-03-17 15:50:03,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 15:50:03,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:03,695 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:03,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:03,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 15:50:03,900 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:03,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 480523828, now seen corresponding path program 1 times [2025-03-17 15:50:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913340631] [2025-03-17 15:50:03,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:03,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 15:50:03,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 15:50:03,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:03,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:50:03,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:03,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913340631] [2025-03-17 15:50:03,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913340631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:03,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:03,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322684333] [2025-03-17 15:50:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:03,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:03,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:03,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:03,969 INFO L87 Difference]: Start difference. First operand 258 states and 325 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:04,048 INFO L93 Difference]: Finished difference Result 263 states and 326 transitions. [2025-03-17 15:50:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:04,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2025-03-17 15:50:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:04,051 INFO L225 Difference]: With dead ends: 263 [2025-03-17 15:50:04,051 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 15:50:04,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:04,052 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 35 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:04,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 344 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 15:50:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2025-03-17 15:50:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 182 states have (on average 1.510989010989011) internal successors, (275), 230 states have internal predecessors, (275), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 323 transitions. [2025-03-17 15:50:04,060 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 323 transitions. Word has length 59 [2025-03-17 15:50:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:04,061 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 323 transitions. [2025-03-17 15:50:04,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 323 transitions. [2025-03-17 15:50:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:50:04,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:04,061 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:04,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 15:50:04,062 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:04,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2073066702, now seen corresponding path program 1 times [2025-03-17 15:50:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:04,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888375299] [2025-03-17 15:50:04,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:04,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:50:04,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:50:04,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:04,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:50:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888375299] [2025-03-17 15:50:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888375299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:04,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:04,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911494939] [2025-03-17 15:50:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:04,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:04,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:04,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:04,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:04,126 INFO L87 Difference]: Start difference. First operand 258 states and 323 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:04,204 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2025-03-17 15:50:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2025-03-17 15:50:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:04,205 INFO L225 Difference]: With dead ends: 261 [2025-03-17 15:50:04,205 INFO L226 Difference]: Without dead ends: 259 [2025-03-17 15:50:04,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:04,206 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 29 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:04,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 339 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-17 15:50:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2025-03-17 15:50:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 182 states have (on average 1.5) internal successors, (273), 230 states have internal predecessors, (273), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 321 transitions. [2025-03-17 15:50:04,215 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 321 transitions. Word has length 61 [2025-03-17 15:50:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:04,215 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 321 transitions. [2025-03-17 15:50:04,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 321 transitions. [2025-03-17 15:50:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 15:50:04,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:04,216 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:04,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 15:50:04,216 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:04,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash 647727152, now seen corresponding path program 1 times [2025-03-17 15:50:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:04,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979501224] [2025-03-17 15:50:04,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:04,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:50:04,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:50:04,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:04,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:04,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862661304] [2025-03-17 15:50:04,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:04,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:04,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:04,243 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:04,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:50:04,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:50:04,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:50:04,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:04,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:04,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:50:04,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:04,321 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:50:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:50:04,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:50:04,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:04,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979501224] [2025-03-17 15:50:04,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:04,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862661304] [2025-03-17 15:50:04,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862661304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:04,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:04,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:04,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800990259] [2025-03-17 15:50:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:04,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:50:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:04,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:50:04,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:04,426 INFO L87 Difference]: Start difference. First operand 258 states and 321 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:04,558 INFO L93 Difference]: Finished difference Result 285 states and 345 transitions. [2025-03-17 15:50:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:50:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-03-17 15:50:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:04,561 INFO L225 Difference]: With dead ends: 285 [2025-03-17 15:50:04,561 INFO L226 Difference]: Without dead ends: 283 [2025-03-17 15:50:04,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:04,561 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 92 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:04,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 485 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-17 15:50:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 258. [2025-03-17 15:50:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 182 states have (on average 1.489010989010989) internal successors, (271), 230 states have internal predecessors, (271), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 319 transitions. [2025-03-17 15:50:04,573 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 319 transitions. Word has length 63 [2025-03-17 15:50:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:04,574 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 319 transitions. [2025-03-17 15:50:04,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2025-03-17 15:50:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:50:04,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:04,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:04,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:04,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:04,775 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_28_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:04,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1332003407, now seen corresponding path program 1 times [2025-03-17 15:50:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582113386] [2025-03-17 15:50:04,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:04,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:50:04,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:50:04,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:04,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 15:50:04,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:04,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582113386] [2025-03-17 15:50:04,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582113386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:04,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:04,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131319578] [2025-03-17 15:50:04,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:04,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:04,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:04,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:04,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:04,839 INFO L87 Difference]: Start difference. First operand 258 states and 319 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 1 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:50:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:04,898 INFO L93 Difference]: Finished difference Result 258 states and 319 transitions. [2025-03-17 15:50:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 1 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 65 [2025-03-17 15:50:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:04,900 INFO L225 Difference]: With dead ends: 258 [2025-03-17 15:50:04,900 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 15:50:04,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:04,901 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 52 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:04,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 365 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 15:50:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-03-17 15:50:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.4725274725274726) internal successors, (268), 229 states have internal predecessors, (268), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 316 transitions. [2025-03-17 15:50:04,912 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 316 transitions. Word has length 65 [2025-03-17 15:50:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:04,913 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 316 transitions. [2025-03-17 15:50:04,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (6), 1 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:50:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 316 transitions. [2025-03-17 15:50:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:50:04,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:04,913 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:04,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 15:50:04,914 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_28_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:04,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1657567366, now seen corresponding path program 1 times [2025-03-17 15:50:04,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:04,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350322369] [2025-03-17 15:50:04,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:04,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:04,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:50:04,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:50:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:04,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 15:50:04,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:04,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350322369] [2025-03-17 15:50:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350322369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045261592] [2025-03-17 15:50:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:04,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:04,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:04,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:04,975 INFO L87 Difference]: Start difference. First operand 257 states and 316 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 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:50:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:05,042 INFO L93 Difference]: Finished difference Result 257 states and 316 transitions. [2025-03-17 15:50:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:05,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 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 66 [2025-03-17 15:50:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:05,043 INFO L225 Difference]: With dead ends: 257 [2025-03-17 15:50:05,043 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 15:50:05,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:05,044 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 49 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:05,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 459 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 15:50:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-17 15:50:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 182 states have (on average 1.456043956043956) internal successors, (265), 228 states have internal predecessors, (265), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 313 transitions. [2025-03-17 15:50:05,054 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 313 transitions. Word has length 66 [2025-03-17 15:50:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:05,054 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 313 transitions. [2025-03-17 15:50:05,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 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:50:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 313 transitions. [2025-03-17 15:50:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 15:50:05,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:05,055 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:05,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 15:50:05,055 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_28_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:05,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:05,055 INFO L85 PathProgramCache]: Analyzing trace with hash -155019185, now seen corresponding path program 1 times [2025-03-17 15:50:05,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:05,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740097011] [2025-03-17 15:50:05,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:05,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:05,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:50:05,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:50:05,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:05,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 15:50:05,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:05,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740097011] [2025-03-17 15:50:05,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740097011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:05,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715760918] [2025-03-17 15:50:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:05,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:05,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:05,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:05,114 INFO L87 Difference]: Start difference. First operand 256 states and 313 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 1 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:50:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:05,186 INFO L93 Difference]: Finished difference Result 256 states and 313 transitions. [2025-03-17 15:50:05,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:05,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 1 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 67 [2025-03-17 15:50:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:05,188 INFO L225 Difference]: With dead ends: 256 [2025-03-17 15:50:05,188 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 15:50:05,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:05,188 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 44 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:05,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 451 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 15:50:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-17 15:50:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 182 states have (on average 1.4395604395604396) internal successors, (262), 227 states have internal predecessors, (262), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 310 transitions. [2025-03-17 15:50:05,199 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 310 transitions. Word has length 67 [2025-03-17 15:50:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:05,199 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 310 transitions. [2025-03-17 15:50:05,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 1 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:50:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 310 transitions. [2025-03-17 15:50:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 15:50:05,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:05,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:05,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 15:50:05,200 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_28_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:05,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:05,201 INFO L85 PathProgramCache]: Analyzing trace with hash -510627420, now seen corresponding path program 1 times [2025-03-17 15:50:05,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:05,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7549655] [2025-03-17 15:50:05,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:05,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:05,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 15:50:05,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 15:50:05,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:05,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 15:50:05,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:05,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7549655] [2025-03-17 15:50:05,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7549655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:05,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:05,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:05,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433122836] [2025-03-17 15:50:05,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:05,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:05,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:05,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:05,274 INFO L87 Difference]: Start difference. First operand 255 states and 310 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 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:50:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:05,330 INFO L93 Difference]: Finished difference Result 255 states and 310 transitions. [2025-03-17 15:50:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:50:05,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 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 68 [2025-03-17 15:50:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:05,333 INFO L225 Difference]: With dead ends: 255 [2025-03-17 15:50:05,333 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 15:50:05,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:05,334 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 41 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:05,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 360 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:50:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 15:50:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-17 15:50:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 182 states have (on average 1.4230769230769231) internal successors, (259), 226 states have internal predecessors, (259), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 307 transitions. [2025-03-17 15:50:05,344 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 307 transitions. Word has length 68 [2025-03-17 15:50:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:05,344 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 307 transitions. [2025-03-17 15:50:05,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 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:50:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 307 transitions. [2025-03-17 15:50:05,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 15:50:05,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:05,348 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:05,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 15:50:05,348 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_28_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:05,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1350419181, now seen corresponding path program 1 times [2025-03-17 15:50:05,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:05,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370239086] [2025-03-17 15:50:05,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:05,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 15:50:05,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:50:05,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:05,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685097421] [2025-03-17 15:50:05,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:05,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:05,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:05,372 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:05,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 15:50:05,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 15:50:05,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:50:05,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:05,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:05,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 15:50:05,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:05,467 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:50:05,665 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 36 treesize of output 13 [2025-03-17 15:50:05,696 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:50:05,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 15:50:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 15:50:05,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:05,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370239086] [2025-03-17 15:50:05,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:05,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685097421] [2025-03-17 15:50:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685097421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:05,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:50:05,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2025-03-17 15:50:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239716539] [2025-03-17 15:50:05,960 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:05,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:50:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:05,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:50:05,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:50:05,962 INFO L87 Difference]: Start difference. First operand 254 states and 307 transitions. Second operand has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:50:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:06,496 INFO L93 Difference]: Finished difference Result 254 states and 307 transitions. [2025-03-17 15:50:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 15:50:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 69 [2025-03-17 15:50:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:06,498 INFO L225 Difference]: With dead ends: 254 [2025-03-17 15:50:06,498 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 15:50:06,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 15:50:06,498 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 332 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:06,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1265 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:50:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 15:50:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-17 15:50:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 182 states have (on average 1.3956043956043955) internal successors, (254), 224 states have internal predecessors, (254), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2025-03-17 15:50:06,517 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 69 [2025-03-17 15:50:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:06,518 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2025-03-17 15:50:06,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 15 states have internal predecessors, (56), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:50:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2025-03-17 15:50:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 15:50:06,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:06,518 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:06,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:06,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 15:50:06,719 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_28_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:06,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1086678334, now seen corresponding path program 1 times [2025-03-17 15:50:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:06,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057759913] [2025-03-17 15:50:06,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:06,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 15:50:06,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 15:50:06,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:06,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:06,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623895373] [2025-03-17 15:50:06,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:06,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:06,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:06,744 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:06,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 15:50:06,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 15:50:06,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 15:50:06,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:06,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:06,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-17 15:50:06,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:06,843 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:50:07,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:50:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 15:50:07,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:07,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057759913] [2025-03-17 15:50:07,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:07,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623895373] [2025-03-17 15:50:07,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623895373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:07,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:50:07,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2025-03-17 15:50:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023338933] [2025-03-17 15:50:07,261 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:07,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:50:07,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:07,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:50:07,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:50:07,262 INFO L87 Difference]: Start difference. First operand 252 states and 302 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:50:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:07,800 INFO L93 Difference]: Finished difference Result 291 states and 326 transitions. [2025-03-17 15:50:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 15:50:07,801 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 70 [2025-03-17 15:50:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:07,802 INFO L225 Difference]: With dead ends: 291 [2025-03-17 15:50:07,802 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 15:50:07,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 15:50:07,804 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 246 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:07,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1445 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:50:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 15:50:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 252. [2025-03-17 15:50:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 182 states have (on average 1.39010989010989) internal successors, (253), 224 states have internal predecessors, (253), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 21 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2025-03-17 15:50:07,819 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 70 [2025-03-17 15:50:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:07,819 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2025-03-17 15:50:07,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:50:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2025-03-17 15:50:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 15:50:07,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:07,821 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 15:50:08,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 15:50:08,025 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:08,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1883360575, now seen corresponding path program 1 times [2025-03-17 15:50:08,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:08,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080010222] [2025-03-17 15:50:08,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:08,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 15:50:08,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 15:50:08,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:08,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:08,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650733494] [2025-03-17 15:50:08,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:08,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:08,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:08,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 15:50:08,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 15:50:08,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 15:50:08,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:08,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:08,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:50:08,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:08,165 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:50:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:50:08,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:50:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080010222] [2025-03-17 15:50:08,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650733494] [2025-03-17 15:50:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650733494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:08,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:08,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774985637] [2025-03-17 15:50:08,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:08,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:08,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:08,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:08,272 INFO L87 Difference]: Start difference. First operand 252 states and 301 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:08,415 INFO L93 Difference]: Finished difference Result 277 states and 325 transitions. [2025-03-17 15:50:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:50:08,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2025-03-17 15:50:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:08,421 INFO L225 Difference]: With dead ends: 277 [2025-03-17 15:50:08,421 INFO L226 Difference]: Without dead ends: 276 [2025-03-17 15:50:08,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:08,422 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 101 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:08,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 391 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-17 15:50:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2025-03-17 15:50:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 184 states have (on average 1.3858695652173914) internal successors, (255), 225 states have internal predecessors, (255), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 303 transitions. [2025-03-17 15:50:08,434 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 303 transitions. Word has length 71 [2025-03-17 15:50:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:08,434 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 303 transitions. [2025-03-17 15:50:08,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 303 transitions. [2025-03-17 15:50:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 15:50:08,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:08,435 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:08,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 15:50:08,636 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1745364385, now seen corresponding path program 1 times [2025-03-17 15:50:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513998636] [2025-03-17 15:50:08,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:08,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 15:50:08,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 15:50:08,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:08,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951467387] [2025-03-17 15:50:08,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:08,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:08,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:08,659 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:08,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 15:50:08,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 15:50:08,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 15:50:08,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:08,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:50:08,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:08,752 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:50:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:50:08,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:50:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513998636] [2025-03-17 15:50:08,840 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:08,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951467387] [2025-03-17 15:50:08,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951467387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:08,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:08,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:50:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778926763] [2025-03-17 15:50:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:08,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:50:08,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:08,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:50:08,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:50:08,842 INFO L87 Difference]: Start difference. First operand 254 states and 303 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:08,979 INFO L93 Difference]: Finished difference Result 276 states and 324 transitions. [2025-03-17 15:50:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:50:08,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2025-03-17 15:50:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:08,980 INFO L225 Difference]: With dead ends: 276 [2025-03-17 15:50:08,980 INFO L226 Difference]: Without dead ends: 275 [2025-03-17 15:50:08,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:50:08,981 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 99 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:08,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 393 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-17 15:50:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 255. [2025-03-17 15:50:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 185 states have (on average 1.3837837837837839) internal successors, (256), 226 states have internal predecessors, (256), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2025-03-17 15:50:08,994 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 72 [2025-03-17 15:50:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:08,994 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2025-03-17 15:50:08,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2025-03-17 15:50:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:50:08,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:08,995 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 15:50:09,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 15:50:09,196 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:09,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1728278849, now seen corresponding path program 1 times [2025-03-17 15:50:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:09,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864312996] [2025-03-17 15:50:09,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:09,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:50:09,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:50:09,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:09,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:50:09,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864312996] [2025-03-17 15:50:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864312996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:09,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:09,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:09,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906423897] [2025-03-17 15:50:09,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:09,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:09,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:09,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:09,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:09,272 INFO L87 Difference]: Start difference. First operand 255 states and 304 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:09,361 INFO L93 Difference]: Finished difference Result 269 states and 323 transitions. [2025-03-17 15:50:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:09,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-03-17 15:50:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:09,362 INFO L225 Difference]: With dead ends: 269 [2025-03-17 15:50:09,362 INFO L226 Difference]: Without dead ends: 267 [2025-03-17 15:50:09,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:09,363 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:09,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 288 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-17 15:50:09,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 257. [2025-03-17 15:50:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 187 states have (on average 1.3796791443850267) internal successors, (258), 228 states have internal predecessors, (258), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2025-03-17 15:50:09,373 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 73 [2025-03-17 15:50:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:09,373 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2025-03-17 15:50:09,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2025-03-17 15:50:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 15:50:09,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:09,374 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 15:50:09,374 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1276371645, now seen corresponding path program 1 times [2025-03-17 15:50:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:09,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097848284] [2025-03-17 15:50:09,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:09,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 15:50:09,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 15:50:09,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:09,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [12913497] [2025-03-17 15:50:09,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:09,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:09,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:09,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 15:50:09,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 15:50:09,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 15:50:09,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:09,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:09,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 15:50:09,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:09,492 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:50:09,494 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:50:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:50:09,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:50:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097848284] [2025-03-17 15:50:09,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12913497] [2025-03-17 15:50:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12913497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:50:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81989816] [2025-03-17 15:50:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:50:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:09,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:50:09,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:50:09,682 INFO L87 Difference]: Start difference. First operand 257 states and 306 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:09,845 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2025-03-17 15:50:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:50:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2025-03-17 15:50:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:09,846 INFO L225 Difference]: With dead ends: 273 [2025-03-17 15:50:09,846 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 15:50:09,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:50:09,846 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 92 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:09,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 389 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 196 Invalid, 3 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 15:50:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 259. [2025-03-17 15:50:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 189 states have (on average 1.3756613756613756) internal successors, (260), 230 states have internal predecessors, (260), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 15:50:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 308 transitions. [2025-03-17 15:50:09,856 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 308 transitions. Word has length 75 [2025-03-17 15:50:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:09,856 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 308 transitions. [2025-03-17 15:50:09,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 308 transitions. [2025-03-17 15:50:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 15:50:09,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:09,857 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:09,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:10,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:10,058 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting func_to_recursive_line_28_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:10,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:10,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1355014571, now seen corresponding path program 1 times [2025-03-17 15:50:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:10,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292976877] [2025-03-17 15:50:10,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:10,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:10,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 15:50:10,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 15:50:10,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:10,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [377580050] [2025-03-17 15:50:10,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:10,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:10,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:10,085 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:10,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 15:50:10,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 15:50:10,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 15:50:10,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:10,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:10,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 15:50:10,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:10,186 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:50:10,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:50:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 45 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 15:50:10,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292976877] [2025-03-17 15:50:10,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377580050] [2025-03-17 15:50:10,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377580050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:10,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:50:10,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-17 15:50:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105267511] [2025-03-17 15:50:10,471 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:10,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 15:50:10,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:10,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 15:50:10,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:50:10,472 INFO L87 Difference]: Start difference. First operand 259 states and 308 transitions. Second operand has 15 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 15:50:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:10,930 INFO L93 Difference]: Finished difference Result 337 states and 372 transitions. [2025-03-17 15:50:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 15:50:10,931 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 77 [2025-03-17 15:50:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:10,932 INFO L225 Difference]: With dead ends: 337 [2025-03-17 15:50:10,932 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 15:50:10,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:50:10,933 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 249 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:10,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1432 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:50:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 15:50:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 277. [2025-03-17 15:50:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 204 states have (on average 1.392156862745098) internal successors, (284), 245 states have internal predecessors, (284), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2025-03-17 15:50:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 336 transitions. [2025-03-17 15:50:10,946 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 336 transitions. Word has length 77 [2025-03-17 15:50:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:10,947 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 336 transitions. [2025-03-17 15:50:10,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 15:50:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 336 transitions. [2025-03-17 15:50:10,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 15:50:10,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:10,949 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:10,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 15:50:11,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-17 15:50:11,154 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting func_to_recursive_line_28_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:11,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:11,154 INFO L85 PathProgramCache]: Analyzing trace with hash -944221250, now seen corresponding path program 1 times [2025-03-17 15:50:11,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:11,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579396880] [2025-03-17 15:50:11,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:11,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 15:50:11,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 15:50:11,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:11,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:50:11,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799963904] [2025-03-17 15:50:11,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:11,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:11,176 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:11,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 15:50:11,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 15:50:11,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 15:50:11,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:11,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:11,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 15:50:11,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:11,280 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:50:11,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 15:50:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 15:50:11,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:11,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:11,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579396880] [2025-03-17 15:50:11,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:50:11,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799963904] [2025-03-17 15:50:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799963904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:11,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:50:11,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-17 15:50:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653771633] [2025-03-17 15:50:11,545 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:11,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:50:11,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:11,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:50:11,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:50:11,545 INFO L87 Difference]: Start difference. First operand 277 states and 336 transitions. Second operand has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:11,743 INFO L93 Difference]: Finished difference Result 336 states and 371 transitions. [2025-03-17 15:50:11,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:50:11,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-17 15:50:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:11,744 INFO L225 Difference]: With dead ends: 336 [2025-03-17 15:50:11,744 INFO L226 Difference]: Without dead ends: 335 [2025-03-17 15:50:11,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:50:11,745 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 226 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:11,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 933 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:50:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-17 15:50:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 277. [2025-03-17 15:50:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 204 states have (on average 1.3872549019607843) internal successors, (283), 245 states have internal predecessors, (283), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2025-03-17 15:50:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 335 transitions. [2025-03-17 15:50:11,754 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 335 transitions. Word has length 78 [2025-03-17 15:50:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:11,755 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 335 transitions. [2025-03-17 15:50:11,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:50:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 335 transitions. [2025-03-17 15:50:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 15:50:11,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:11,755 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:11,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 15:50:11,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:11,960 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1767493957, now seen corresponding path program 1 times [2025-03-17 15:50:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412157528] [2025-03-17 15:50:11,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:11,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 15:50:11,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 15:50:11,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:11,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:50:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:12,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412157528] [2025-03-17 15:50:12,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412157528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:50:12,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:50:12,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:50:12,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704434442] [2025-03-17 15:50:12,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:50:12,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:50:12,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:12,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:50:12,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:12,042 INFO L87 Difference]: Start difference. First operand 277 states and 335 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:50:12,124 INFO L93 Difference]: Finished difference Result 285 states and 346 transitions. [2025-03-17 15:50:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:50:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-03-17 15:50:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:50:12,125 INFO L225 Difference]: With dead ends: 285 [2025-03-17 15:50:12,125 INFO L226 Difference]: Without dead ends: 283 [2025-03-17 15:50:12,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:50:12,126 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 28 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:50:12,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 304 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:50:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-17 15:50:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 279. [2025-03-17 15:50:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 206 states have (on average 1.383495145631068) internal successors, (285), 247 states have internal predecessors, (285), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2025-03-17 15:50:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 337 transitions. [2025-03-17 15:50:12,135 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 337 transitions. Word has length 77 [2025-03-17 15:50:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:50:12,135 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 337 transitions. [2025-03-17 15:50:12,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:50:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 337 transitions. [2025-03-17 15:50:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 15:50:12,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:50:12,136 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:50:12,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 15:50:12,136 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting func_to_recursive_line_28_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-03-17 15:50:12,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:50:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 793912329, now seen corresponding path program 1 times [2025-03-17 15:50:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:50:12,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428411096] [2025-03-17 15:50:12,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:50:12,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 15:50:12,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 15:50:12,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:12,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:50:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:50:12,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428411096] [2025-03-17 15:50:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428411096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:12,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825244157] [2025-03-17 15:50:12,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:50:12,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:50:12,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:50:12,432 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:50:12,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 15:50:12,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 15:50:12,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 15:50:12,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:50:12,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:50:12,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-17 15:50:12,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:50:12,522 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:50:12,524 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:50:22,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 15:50:22,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2025-03-17 15:50:23,239 INFO L349 Elim1Store]: treesize reduction 52, result has 51.4 percent of original size [2025-03-17 15:50:23,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 76 [2025-03-17 15:50:23,691 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:50:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 10 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 15:50:23,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:50:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825244157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:50:33,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:50:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21] total 27 [2025-03-17 15:50:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012583796] [2025-03-17 15:50:33,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:50:33,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 15:50:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:50:33,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 15:50:33,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1366, Unknown=2, NotChecked=0, Total=1560 [2025-03-17 15:50:33,025 INFO L87 Difference]: Start difference. First operand 279 states and 337 transitions. Second operand has 28 states, 25 states have (on average 4.08) internal successors, (102), 24 states have internal predecessors, (102), 7 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-17 15:50:37,038 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:50:41,702 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:50:46,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:50:51,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:50:56,516 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:51:00,615 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:51:04,628 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:51:08,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 15:51:12,808 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:51:16,811 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]