./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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_ps5.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 6f3643eb7577eb0ba12bcd7a7f20ec9e29deb69664963fe3575fff225cd03ad0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:49:29,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:49:29,915 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:29,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:49:29,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:49:29,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:49:29,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:49:29,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:49:29,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:49:29,937 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:49:29,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:49:29,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:49:29,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:49:29,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:49:29,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:49:29,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:49:29,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:49:29,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:49:29,940 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:49:29,940 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:49:29,940 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:49:29,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:49:29,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:49:29,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:49:29,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:49:29,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:49:29,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:49:29,941 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:49:29,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:49:29,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:49:29,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:49:29,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:49:29,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:49:29,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:49:29,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:49:29,941 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 -> 6f3643eb7577eb0ba12bcd7a7f20ec9e29deb69664963fe3575fff225cd03ad0 [2025-03-17 15:49:30,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:49:30,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:49:30,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:49:30,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:49:30,194 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:49:30,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c [2025-03-17 15:49:31,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe6a4f187/ed269e27d12f4b07b197bc615292c428/FLAG749b46a43 [2025-03-17 15:49:31,603 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:49:31,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c [2025-03-17 15:49:31,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe6a4f187/ed269e27d12f4b07b197bc615292c428/FLAG749b46a43 [2025-03-17 15:49:31,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe6a4f187/ed269e27d12f4b07b197bc615292c428 [2025-03-17 15:49:31,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:49:31,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:49:31,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:49:31,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:49:31,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:49:31,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:49:31" (1/1) ... [2025-03-17 15:49:31,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7833f95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:31, skipping insertion in model container [2025-03-17 15:49:31,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:49:31" (1/1) ... [2025-03-17 15:49:31,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:49:31,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:49:31,797 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:49:31,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:49:31,833 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:49:31,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:31 WrapperNode [2025-03-17 15:49:31,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:49:31,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:49:31,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:49:31,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:49:31,839 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:31" (1/1) ... [2025-03-17 15:49:31,845 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:31" (1/1) ... [2025-03-17 15:49:31,864 INFO L138 Inliner]: procedures = 16, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2025-03-17 15:49:31,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:49:31,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:49:31,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:49:31,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:49:31,871 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:31" (1/1) ... [2025-03-17 15:49:31,871 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:31" (1/1) ... [2025-03-17 15:49:31,878 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:31" (1/1) ... [2025-03-17 15:49:31,892 INFO L175 MemorySlicer]: Split 56 memory accesses to 6 slices as follows [2, 6, 4, 36, 5, 3]. 64 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0, 0, 0, 0]. The 7 writes are split as follows [0, 0, 2, 2, 2, 1]. [2025-03-17 15:49:31,894 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:31" (1/1) ... [2025-03-17 15:49:31,894 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:31" (1/1) ... [2025-03-17 15:49:31,899 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:31" (1/1) ... [2025-03-17 15:49:31,903 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:31" (1/1) ... [2025-03-17 15:49:31,907 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:31" (1/1) ... [2025-03-17 15:49:31,908 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:31" (1/1) ... [2025-03-17 15:49:31,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:49:31,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:49:31,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:49:31,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:49:31,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:31" (1/1) ... [2025-03-17 15:49:31,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:49:31,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:31,935 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:31,941 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:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:49:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_33_0 [2025-03-17 15:49:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_33_0 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 15:49:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:49:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:49:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 15:49:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 15:49:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 15:49:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 15:49:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 15:49:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 15:49:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:49:31,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:49:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:49:32,035 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:49:32,037 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:49:32,537 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-17 15:49:32,569 INFO L? ?]: Removed 366 outVars from TransFormulas that were not future-live. [2025-03-17 15:49:32,571 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:49:32,583 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:49:32,585 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:49:32,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:49:32 BoogieIcfgContainer [2025-03-17 15:49:32,585 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:49:32,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:49:32,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:49:32,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:49:32,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:49:31" (1/3) ... [2025-03-17 15:49:32,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac1a4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:49:32, skipping insertion in model container [2025-03-17 15:49:32,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:49:31" (2/3) ... [2025-03-17 15:49:32,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac1a4d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:49:32, skipping insertion in model container [2025-03-17 15:49:32,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:49:32" (3/3) ... [2025-03-17 15:49:32,594 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps5.c [2025-03-17 15:49:32,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:49:32,607 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps5.c that has 3 procedures, 190 locations, 1 initial locations, 0 loop locations, and 84 error locations. [2025-03-17 15:49:32,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:49:32,671 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;@540c4b30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:49:32,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-03-17 15:49:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 183 states have internal predecessors, (185), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:49:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:49:32,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:32,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:49:32,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_25_to_33_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:32,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash 208369109, now seen corresponding path program 1 times [2025-03-17 15:49:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137692256] [2025-03-17 15:49:32,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:32,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:49:32,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:49:32,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:32,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:33,053 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:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:33,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137692256] [2025-03-17 15:49:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137692256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:33,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234899095] [2025-03-17 15:49:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:33,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:33,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:33,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:33,075 INFO L87 Difference]: Start difference. First operand has 190 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 183 states have internal predecessors, (185), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:33,385 INFO L93 Difference]: Finished difference Result 526 states and 556 transitions. [2025-03-17 15:49:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:33,389 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:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:33,397 INFO L225 Difference]: With dead ends: 526 [2025-03-17 15:49:33,397 INFO L226 Difference]: Without dead ends: 333 [2025-03-17 15:49:33,402 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:33,405 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 264 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:33,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 718 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-17 15:49:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 226. [2025-03-17 15:49:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.8134328358208955) internal successors, (243), 218 states have internal predecessors, (243), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 254 transitions. [2025-03-17 15:49:33,448 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 254 transitions. Word has length 5 [2025-03-17 15:49:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:33,448 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 254 transitions. [2025-03-17 15:49:33,448 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:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 254 transitions. [2025-03-17 15:49:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:49:33,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:33,449 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:33,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:49:33,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_33_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:33,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash 71202859, now seen corresponding path program 1 times [2025-03-17 15:49:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970875398] [2025-03-17 15:49:33,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:33,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:49:33,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:49:33,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:33,676 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:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:33,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970875398] [2025-03-17 15:49:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970875398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:33,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:33,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969975974] [2025-03-17 15:49:33,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:33,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:33,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:33,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:33,680 INFO L87 Difference]: Start difference. First operand 226 states and 254 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:33,925 INFO L93 Difference]: Finished difference Result 333 states and 338 transitions. [2025-03-17 15:49:33,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:33,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 15:49:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:33,928 INFO L225 Difference]: With dead ends: 333 [2025-03-17 15:49:33,928 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 15:49:33,928 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:33,929 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 220 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:33,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 689 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 15:49:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 226. [2025-03-17 15:49:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 218 states have internal predecessors, (235), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 246 transitions. [2025-03-17 15:49:33,951 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 246 transitions. Word has length 15 [2025-03-17 15:49:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:33,951 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 246 transitions. [2025-03-17 15:49:33,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 246 transitions. [2025-03-17 15:49:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 15:49:33,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:33,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:33,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:49:33,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_33_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:33,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1328780195, now seen corresponding path program 1 times [2025-03-17 15:49:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880087245] [2025-03-17 15:49:33,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:33,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:49:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:49:33,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:33,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654092801] [2025-03-17 15:49:33,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:33,995 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:33,997 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:34,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:49:34,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:49:34,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:34,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:34,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 15:49:34,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:34,097 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:34,215 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:34,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:34,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:34,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880087245] [2025-03-17 15:49:34,217 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654092801] [2025-03-17 15:49:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654092801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:34,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:34,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:34,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959995192] [2025-03-17 15:49:34,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:34,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:34,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:34,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:34,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:34,218 INFO L87 Difference]: Start difference. First operand 226 states and 246 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:34,450 INFO L93 Difference]: Finished difference Result 325 states and 330 transitions. [2025-03-17 15:49:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-17 15:49:34,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:34,452 INFO L225 Difference]: With dead ends: 325 [2025-03-17 15:49:34,453 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 15:49:34,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:34,453 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 229 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:34,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 716 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 15:49:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 226. [2025-03-17 15:49:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.7388059701492538) internal successors, (233), 218 states have internal predecessors, (233), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2025-03-17 15:49:34,471 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 23 [2025-03-17 15:49:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:34,472 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2025-03-17 15:49:34,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2025-03-17 15:49:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:49:34,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:34,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:34,480 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:34,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:34,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_33_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:34,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1352481409, now seen corresponding path program 1 times [2025-03-17 15:49:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293485291] [2025-03-17 15:49:34,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:34,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:34,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:49:34,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:49:34,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:34,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:34,839 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:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293485291] [2025-03-17 15:49:34,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293485291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:34,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:34,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383949990] [2025-03-17 15:49:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:34,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:34,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:34,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:34,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:34,841 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand has 6 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:35,026 INFO L93 Difference]: Finished difference Result 323 states and 328 transitions. [2025-03-17 15:49:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:35,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-17 15:49:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:35,028 INFO L225 Difference]: With dead ends: 323 [2025-03-17 15:49:35,028 INFO L226 Difference]: Without dead ends: 317 [2025-03-17 15:49:35,029 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:35,029 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 178 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:35,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 701 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-17 15:49:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 226. [2025-03-17 15:49:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6940298507462686) internal successors, (227), 218 states have internal predecessors, (227), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 238 transitions. [2025-03-17 15:49:35,037 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 238 transitions. Word has length 25 [2025-03-17 15:49:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:35,037 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 238 transitions. [2025-03-17 15:49:35,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 238 transitions. [2025-03-17 15:49:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:49:35,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:35,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:35,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:49:35,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_33_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:35,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1539002597, now seen corresponding path program 1 times [2025-03-17 15:49:35,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:35,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248785330] [2025-03-17 15:49:35,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:35,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:35,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:49:35,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:49:35,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:35,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:35,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [802949648] [2025-03-17 15:49:35,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:35,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:35,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:35,061 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:35,064 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:35,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:49:35,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:49:35,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:35,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:35,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:49:35,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:35,141 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:35,279 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:35,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:35,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:35,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248785330] [2025-03-17 15:49:35,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:35,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802949648] [2025-03-17 15:49:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802949648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:35,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569218520] [2025-03-17 15:49:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:35,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:35,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:35,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:35,281 INFO L87 Difference]: Start difference. First operand 226 states and 238 transitions. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:35,697 INFO L93 Difference]: Finished difference Result 317 states and 322 transitions. [2025-03-17 15:49:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-17 15:49:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:35,698 INFO L225 Difference]: With dead ends: 317 [2025-03-17 15:49:35,698 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 15:49:35,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:35,699 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 179 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:35,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 691 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:49:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 15:49:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 226. [2025-03-17 15:49:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6865671641791045) internal successors, (226), 218 states have internal predecessors, (226), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 237 transitions. [2025-03-17 15:49:35,711 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 237 transitions. Word has length 31 [2025-03-17 15:49:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:35,711 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 237 transitions. [2025-03-17 15:49:35,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 237 transitions. [2025-03-17 15:49:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 15:49:35,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:35,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:35,719 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:35,916 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:35,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_33_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:35,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash -464440238, now seen corresponding path program 1 times [2025-03-17 15:49:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386937887] [2025-03-17 15:49:35,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:35,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 15:49:35,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 15:49:35,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:35,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:35,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340273288] [2025-03-17 15:49:35,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:35,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:35,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:35,946 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:35,948 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:35,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 15:49:36,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 15:49:36,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:36,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:36,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 15:49:36,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:36,022 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:36,176 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:36,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:36,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:36,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386937887] [2025-03-17 15:49:36,176 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:36,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340273288] [2025-03-17 15:49:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340273288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:36,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:36,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:36,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320831894] [2025-03-17 15:49:36,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:36,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:49:36,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:36,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:49:36,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:36,178 INFO L87 Difference]: Start difference. First operand 226 states and 237 transitions. Second operand has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:36,441 INFO L93 Difference]: Finished difference Result 316 states and 321 transitions. [2025-03-17 15:49:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:49:36,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 32 [2025-03-17 15:49:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:36,443 INFO L225 Difference]: With dead ends: 316 [2025-03-17 15:49:36,443 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 15:49:36,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:49:36,444 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 163 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:36,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 953 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 15:49:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 226. [2025-03-17 15:49:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6791044776119404) internal successors, (225), 218 states have internal predecessors, (225), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 236 transitions. [2025-03-17 15:49:36,451 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 236 transitions. Word has length 32 [2025-03-17 15:49:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:36,452 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 236 transitions. [2025-03-17 15:49:36,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 236 transitions. [2025-03-17 15:49:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 15:49:36,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:36,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:36,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:49:36,653 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:36,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_25_to_33_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:36,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1512745479, now seen corresponding path program 1 times [2025-03-17 15:49:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871349778] [2025-03-17 15:49:36,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:36,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:36,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 15:49:36,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 15:49:36,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:36,798 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:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:36,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871349778] [2025-03-17 15:49:36,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871349778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:36,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:36,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:36,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281089465] [2025-03-17 15:49:36,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:36,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:36,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:36,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:36,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:36,801 INFO L87 Difference]: Start difference. First operand 226 states and 236 transitions. Second operand has 6 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:36,892 INFO L93 Difference]: Finished difference Result 313 states and 317 transitions. [2025-03-17 15:49:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-17 15:49:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:36,893 INFO L225 Difference]: With dead ends: 313 [2025-03-17 15:49:36,893 INFO L226 Difference]: Without dead ends: 312 [2025-03-17 15:49:36,893 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:36,894 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 169 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:36,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 859 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-17 15:49:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 226. [2025-03-17 15:49:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.671641791044776) internal successors, (224), 218 states have internal predecessors, (224), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 235 transitions. [2025-03-17 15:49:36,905 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 235 transitions. Word has length 33 [2025-03-17 15:49:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:36,905 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 235 transitions. [2025-03-17 15:49:36,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 235 transitions. [2025-03-17 15:49:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:49:36,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:36,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:36,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:49:36,907 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_25_to_33_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 349530416, now seen corresponding path program 1 times [2025-03-17 15:49:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458955996] [2025-03-17 15:49:36,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:36,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:49:36,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:49:36,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:36,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:37,033 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:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:37,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458955996] [2025-03-17 15:49:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458955996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:37,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:37,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163338059] [2025-03-17 15:49:37,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:37,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:37,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:37,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:37,035 INFO L87 Difference]: Start difference. First operand 226 states and 235 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:37,118 INFO L93 Difference]: Finished difference Result 312 states and 316 transitions. [2025-03-17 15:49:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 34 [2025-03-17 15:49:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:37,120 INFO L225 Difference]: With dead ends: 312 [2025-03-17 15:49:37,120 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 15:49:37,120 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:37,120 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 166 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:37,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 861 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 15:49:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 226. [2025-03-17 15:49:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.664179104477612) internal successors, (223), 218 states have internal predecessors, (223), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 234 transitions. [2025-03-17 15:49:37,126 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 234 transitions. Word has length 34 [2025-03-17 15:49:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:37,127 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 234 transitions. [2025-03-17 15:49:37,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 234 transitions. [2025-03-17 15:49:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:49:37,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:37,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:37,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:49:37,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_33_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:37,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2049458985, now seen corresponding path program 1 times [2025-03-17 15:49:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655108468] [2025-03-17 15:49:37,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:37,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:37,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:49:37,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:49:37,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:37,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:37,265 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:37,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655108468] [2025-03-17 15:49:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655108468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750943147] [2025-03-17 15:49:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:37,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:37,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:37,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:37,267 INFO L87 Difference]: Start difference. First operand 226 states and 234 transitions. Second operand has 7 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:37,632 INFO L93 Difference]: Finished difference Result 311 states and 315 transitions. [2025-03-17 15:49:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:37,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 15:49:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:37,634 INFO L225 Difference]: With dead ends: 311 [2025-03-17 15:49:37,634 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 15:49:37,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:37,635 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 170 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:37,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 832 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:49:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 15:49:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 226. [2025-03-17 15:49:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6567164179104477) internal successors, (222), 218 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 233 transitions. [2025-03-17 15:49:37,643 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 233 transitions. Word has length 35 [2025-03-17 15:49:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:37,643 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 233 transitions. [2025-03-17 15:49:37,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 233 transitions. [2025-03-17 15:49:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 15:49:37,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:37,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:37,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 15:49:37,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_25_to_33_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:37,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash 891280910, now seen corresponding path program 1 times [2025-03-17 15:49:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524166234] [2025-03-17 15:49:37,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:37,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:37,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:49:37,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:49:37,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:37,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:37,779 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:37,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524166234] [2025-03-17 15:49:37,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524166234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:37,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:37,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:37,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880477526] [2025-03-17 15:49:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:37,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:37,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:37,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:37,780 INFO L87 Difference]: Start difference. First operand 226 states and 233 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:37,976 INFO L93 Difference]: Finished difference Result 310 states and 314 transitions. [2025-03-17 15:49:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 15:49:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:37,978 INFO L225 Difference]: With dead ends: 310 [2025-03-17 15:49:37,978 INFO L226 Difference]: Without dead ends: 309 [2025-03-17 15:49:37,978 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:37,978 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 160 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:37,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 809 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-17 15:49:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 226. [2025-03-17 15:49:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 218 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 232 transitions. [2025-03-17 15:49:37,984 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 232 transitions. Word has length 36 [2025-03-17 15:49:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:37,985 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 232 transitions. [2025-03-17 15:49:37,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 232 transitions. [2025-03-17 15:49:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 15:49:37,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:37,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:37,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:49:37,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_33_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:37,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1859904437, now seen corresponding path program 1 times [2025-03-17 15:49:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:37,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540729387] [2025-03-17 15:49:37,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:37,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:49:38,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:49:38,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:38,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:38,132 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:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540729387] [2025-03-17 15:49:38,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540729387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:38,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:38,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353521004] [2025-03-17 15:49:38,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:38,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:38,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:38,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:38,134 INFO L87 Difference]: Start difference. First operand 226 states and 232 transitions. Second operand has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:38,408 INFO L93 Difference]: Finished difference Result 311 states and 316 transitions. [2025-03-17 15:49:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:38,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-17 15:49:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:38,409 INFO L225 Difference]: With dead ends: 311 [2025-03-17 15:49:38,409 INFO L226 Difference]: Without dead ends: 310 [2025-03-17 15:49:38,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:38,409 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 141 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:38,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 699 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-17 15:49:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 226. [2025-03-17 15:49:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 218 states have internal predecessors, (220), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 231 transitions. [2025-03-17 15:49:38,415 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 231 transitions. Word has length 37 [2025-03-17 15:49:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:38,415 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 231 transitions. [2025-03-17 15:49:38,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 231 transitions. [2025-03-17 15:49:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 15:49:38,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:38,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:38,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:49:38,416 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_25_to_33_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:38,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1822462700, now seen corresponding path program 1 times [2025-03-17 15:49:38,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:38,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778356416] [2025-03-17 15:49:38,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:38,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 15:49:38,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 15:49:38,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:38,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:38,535 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:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778356416] [2025-03-17 15:49:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778356416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:38,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655728392] [2025-03-17 15:49:38,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:38,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:38,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:38,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:38,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:38,537 INFO L87 Difference]: Start difference. First operand 226 states and 231 transitions. Second operand has 6 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:38,756 INFO L93 Difference]: Finished difference Result 310 states and 315 transitions. [2025-03-17 15:49:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:38,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 15:49:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:38,757 INFO L225 Difference]: With dead ends: 310 [2025-03-17 15:49:38,758 INFO L226 Difference]: Without dead ends: 309 [2025-03-17 15:49:38,758 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:38,758 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 135 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:38,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 692 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-17 15:49:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 226. [2025-03-17 15:49:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 218 states have internal predecessors, (219), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 230 transitions. [2025-03-17 15:49:38,767 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 230 transitions. Word has length 38 [2025-03-17 15:49:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:38,767 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 230 transitions. [2025-03-17 15:49:38,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:49:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2025-03-17 15:49:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 15:49:38,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:38,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:38,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:49:38,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_33_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:38,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:38,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1958385597, now seen corresponding path program 1 times [2025-03-17 15:49:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124025405] [2025-03-17 15:49:38,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:38,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:38,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 15:49:38,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 15:49:38,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:38,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:38,948 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:38,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:38,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124025405] [2025-03-17 15:49:38,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124025405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:38,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:38,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:38,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631821272] [2025-03-17 15:49:38,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:38,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:38,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:38,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:38,950 INFO L87 Difference]: Start difference. First operand 226 states and 230 transitions. Second operand has 7 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:39,018 INFO L93 Difference]: Finished difference Result 309 states and 313 transitions. [2025-03-17 15:49:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:39,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-03-17 15:49:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:39,020 INFO L225 Difference]: With dead ends: 309 [2025-03-17 15:49:39,020 INFO L226 Difference]: Without dead ends: 308 [2025-03-17 15:49:39,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:39,021 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 125 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:39,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1057 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:49:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-17 15:49:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 227. [2025-03-17 15:49:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.6296296296296295) internal successors, (220), 219 states have internal predecessors, (220), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2025-03-17 15:49:39,029 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 46 [2025-03-17 15:49:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:39,029 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2025-03-17 15:49:39,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2025-03-17 15:49:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 15:49:39,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:39,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:39,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:49:39,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_25_to_33_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:39,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash 580411354, now seen corresponding path program 1 times [2025-03-17 15:49:39,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:39,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715295563] [2025-03-17 15:49:39,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:39,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:39,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 15:49:39,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 15:49:39,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:39,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:39,163 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:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715295563] [2025-03-17 15:49:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715295563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201732914] [2025-03-17 15:49:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:39,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:49:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:39,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:49:39,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:49:39,164 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:39,233 INFO L93 Difference]: Finished difference Result 308 states and 312 transitions. [2025-03-17 15:49:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:49:39,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-17 15:49:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:39,235 INFO L225 Difference]: With dead ends: 308 [2025-03-17 15:49:39,235 INFO L226 Difference]: Without dead ends: 307 [2025-03-17 15:49:39,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:39,235 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 122 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:39,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1060 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:49:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-17 15:49:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 228. [2025-03-17 15:49:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.625) internal successors, (221), 220 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 232 transitions. [2025-03-17 15:49:39,241 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 232 transitions. Word has length 47 [2025-03-17 15:49:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:39,242 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 232 transitions. [2025-03-17 15:49:39,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2025-03-17 15:49:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 15:49:39,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:39,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:39,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:49:39,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_25_to_33_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:39,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash 812882779, now seen corresponding path program 1 times [2025-03-17 15:49:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:39,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784406908] [2025-03-17 15:49:39,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:39,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 15:49:39,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 15:49:39,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:39,360 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:39,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784406908] [2025-03-17 15:49:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784406908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:49:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756758040] [2025-03-17 15:49:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:39,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:49:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:39,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:49:39,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:49:39,362 INFO L87 Difference]: Start difference. First operand 228 states and 232 transitions. Second operand has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:39,488 INFO L93 Difference]: Finished difference Result 307 states and 312 transitions. [2025-03-17 15:49:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:49:39,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-17 15:49:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:39,490 INFO L225 Difference]: With dead ends: 307 [2025-03-17 15:49:39,490 INFO L226 Difference]: Without dead ends: 305 [2025-03-17 15:49:39,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:39,491 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 121 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:39,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 748 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-17 15:49:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 230. [2025-03-17 15:49:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 138 states have (on average 1.6159420289855073) internal successors, (223), 222 states have internal predecessors, (223), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 15:49:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 234 transitions. [2025-03-17 15:49:39,498 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 234 transitions. Word has length 48 [2025-03-17 15:49:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:39,498 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 234 transitions. [2025-03-17 15:49:39,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2025-03-17 15:49:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 15:49:39,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:39,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:39,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:49:39,500 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:39,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash -569750947, now seen corresponding path program 1 times [2025-03-17 15:49:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:39,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662782410] [2025-03-17 15:49:39,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:39,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 15:49:39,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 15:49:39,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:39,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:39,580 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:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:39,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662782410] [2025-03-17 15:49:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662782410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:39,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:39,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:49:39,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354450585] [2025-03-17 15:49:39,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:49:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:39,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:49:39,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:49:39,581 INFO L87 Difference]: Start difference. First operand 230 states and 234 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:39,737 INFO L93 Difference]: Finished difference Result 307 states and 312 transitions. [2025-03-17 15:49:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:49:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2025-03-17 15:49:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:39,740 INFO L225 Difference]: With dead ends: 307 [2025-03-17 15:49:39,740 INFO L226 Difference]: Without dead ends: 297 [2025-03-17 15:49:39,740 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:49:39,740 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 158 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:39,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 460 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:49:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-17 15:49:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 243. [2025-03-17 15:49:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 150 states have (on average 1.5666666666666667) internal successors, (235), 233 states have internal predecessors, (235), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-17 15:49:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 247 transitions. [2025-03-17 15:49:39,747 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 247 transitions. Word has length 49 [2025-03-17 15:49:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:39,747 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 247 transitions. [2025-03-17 15:49:39,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:49:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 247 transitions. [2025-03-17 15:49:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 15:49:39,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:39,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:39,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 15:49:39,748 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:39,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash -503697671, now seen corresponding path program 1 times [2025-03-17 15:49:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:39,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097363680] [2025-03-17 15:49:39,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:39,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:39,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 15:49:39,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 15:49:39,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:39,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171104550] [2025-03-17 15:49:39,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:39,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:39,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:39,775 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:39,776 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:39,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 15:49:39,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 15:49:39,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:39,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:39,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:49:39,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:39,867 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:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:49:39,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:39,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:39,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097363680] [2025-03-17 15:49:39,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:39,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171104550] [2025-03-17 15:49:39,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171104550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:39,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:39,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:39,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806242711] [2025-03-17 15:49:39,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:39,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:49:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:39,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:49:39,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:39,986 INFO L87 Difference]: Start difference. First operand 243 states and 247 transitions. Second operand has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:40,209 INFO L93 Difference]: Finished difference Result 314 states and 324 transitions. [2025-03-17 15:49:40,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:49:40,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-17 15:49:40,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:40,211 INFO L225 Difference]: With dead ends: 314 [2025-03-17 15:49:40,211 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 15:49:40,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:40,211 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 121 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:40,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 739 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 15:49:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 273. [2025-03-17 15:49:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 178 states have (on average 1.6123595505617978) internal successors, (287), 262 states have internal predecessors, (287), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 301 transitions. [2025-03-17 15:49:40,219 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 301 transitions. Word has length 50 [2025-03-17 15:49:40,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:40,220 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 301 transitions. [2025-03-17 15:49:40,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 301 transitions. [2025-03-17 15:49:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 15:49:40,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:40,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:40,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:49:40,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 15:49:40,424 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_25_to_33_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:40,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:40,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1565241366, now seen corresponding path program 1 times [2025-03-17 15:49:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:40,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237522737] [2025-03-17 15:49:40,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:40,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:49:40,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:49:40,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:40,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:40,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051863690] [2025-03-17 15:49:40,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:40,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:40,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:40,446 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:49:40,447 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:49:40,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:49:40,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:49:40,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:40,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:40,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 15:49:40,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:40,529 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:40,646 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:40,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:40,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237522737] [2025-03-17 15:49:40,647 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051863690] [2025-03-17 15:49:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051863690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:40,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:49:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131915116] [2025-03-17 15:49:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:49:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:40,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:49:40,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:49:40,649 INFO L87 Difference]: Start difference. First operand 273 states and 301 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:40,846 INFO L93 Difference]: Finished difference Result 314 states and 323 transitions. [2025-03-17 15:49:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:49:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-17 15:49:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:40,847 INFO L225 Difference]: With dead ends: 314 [2025-03-17 15:49:40,848 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 15:49:40,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:40,849 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 184 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:40,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 690 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 15:49:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 274. [2025-03-17 15:49:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 263 states have internal predecessors, (288), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2025-03-17 15:49:40,857 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 51 [2025-03-17 15:49:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:40,857 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2025-03-17 15:49:40,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2025-03-17 15:49:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 15:49:40,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:40,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:40,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:49:41,062 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,SelfDestructingSolverStorable17 [2025-03-17 15:49:41,062 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_25_to_33_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:41,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1277842071, now seen corresponding path program 1 times [2025-03-17 15:49:41,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:41,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308661980] [2025-03-17 15:49:41,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:41,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:49:41,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:49:41,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719580970] [2025-03-17 15:49:41,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:41,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:41,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:41,080 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:49:41,082 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:49:41,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:49:41,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:49:41,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:41,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 15:49:41,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:41,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:49:41,266 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:49:41,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 15:49:41,300 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,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:41,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308661980] [2025-03-17 15:49:41,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719580970] [2025-03-17 15:49:41,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719580970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:41,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:41,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:49:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061122746] [2025-03-17 15:49:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:41,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:49:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:41,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:49:41,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:49:41,303 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand has 9 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:41,547 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2025-03-17 15:49:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:49:41,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 15:49:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:41,548 INFO L225 Difference]: With dead ends: 314 [2025-03-17 15:49:41,548 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 15:49:41,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:49:41,549 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 123 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:41,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 904 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 15:49:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 275. [2025-03-17 15:49:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 180 states have (on average 1.6055555555555556) internal successors, (289), 264 states have internal predecessors, (289), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-03-17 15:49:41,555 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 52 [2025-03-17 15:49:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:41,556 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-03-17 15:49:41,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-03-17 15:49:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 15:49:41,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:41,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:41,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:49:41,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:41,757 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_25_to_33_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:41,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash 958398516, now seen corresponding path program 1 times [2025-03-17 15:49:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:41,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749621909] [2025-03-17 15:49:41,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:41,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:49:41,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:49:41,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616032007] [2025-03-17 15:49:41,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:41,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:41,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:41,776 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:49:41,778 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:49:41,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:49:41,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:49:41,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:41,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:41,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 15:49:41,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:41,858 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:41,943 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:49:41,976 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,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:41,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:41,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749621909] [2025-03-17 15:49:41,977 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:41,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616032007] [2025-03-17 15:49:41,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616032007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:41,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:41,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:49:41,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374286357] [2025-03-17 15:49:41,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:41,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:49:41,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:41,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:49:41,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:49:41,978 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:42,241 INFO L93 Difference]: Finished difference Result 314 states and 321 transitions. [2025-03-17 15:49:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:49:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-17 15:49:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:42,242 INFO L225 Difference]: With dead ends: 314 [2025-03-17 15:49:42,242 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 15:49:42,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:49:42,243 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 122 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:42,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 990 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 15:49:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 276. [2025-03-17 15:49:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 181 states have (on average 1.6022099447513811) internal successors, (290), 265 states have internal predecessors, (290), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2025-03-17 15:49:42,249 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 53 [2025-03-17 15:49:42,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:42,249 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2025-03-17 15:49:42,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2025-03-17 15:49:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 15:49:42,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:42,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:49:42,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:42,454 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_25_to_33_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -354417099, now seen corresponding path program 1 times [2025-03-17 15:49:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855625092] [2025-03-17 15:49:42,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:42,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 15:49:42,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 15:49:42,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:42,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149548486] [2025-03-17 15:49:42,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:42,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:42,473 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:49:42,475 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:49:42,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 15:49:42,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 15:49:42,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:42,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:42,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 15:49:42,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:42,575 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,668 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:49:42,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-17 15:49:42,730 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,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:42,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855625092] [2025-03-17 15:49:42,730 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:42,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149548486] [2025-03-17 15:49:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149548486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:42,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:42,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:49:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607154336] [2025-03-17 15:49:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:42,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:49:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:42,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:49:42,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:42,732 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 10 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:42,976 INFO L93 Difference]: Finished difference Result 314 states and 320 transitions. [2025-03-17 15:49:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:49:42,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-17 15:49:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:42,977 INFO L225 Difference]: With dead ends: 314 [2025-03-17 15:49:42,977 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 15:49:42,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:49:42,978 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 183 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:42,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 939 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 15:49:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 277. [2025-03-17 15:49:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 182 states have (on average 1.598901098901099) internal successors, (291), 266 states have internal predecessors, (291), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 305 transitions. [2025-03-17 15:49:42,986 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 305 transitions. Word has length 54 [2025-03-17 15:49:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:42,986 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 305 transitions. [2025-03-17 15:49:42,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 305 transitions. [2025-03-17 15:49:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:49:42,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:42,987 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:42,995 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:49:43,188 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,SelfDestructingSolverStorable20 [2025-03-17 15:49:43,188 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_25_to_33_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:43,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1897971794, now seen corresponding path program 1 times [2025-03-17 15:49:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:43,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373866592] [2025-03-17 15:49:43,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:43,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:49:43,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:49:43,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:43,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:49:43,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711066748] [2025-03-17 15:49:43,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:43,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:43,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:49:43,206 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:49:43,208 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:49:43,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:49:43,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:49:43,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:43,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:49:43,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:49:43,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:49:43,289 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,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:49:43,432 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:43,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:49:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:49:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373866592] [2025-03-17 15:49:43,433 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:49:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711066748] [2025-03-17 15:49:43,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711066748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:49:43,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:49:43,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:49:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337870976] [2025-03-17 15:49:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:49:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:49:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:49:43,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:49:43,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:49:43,434 INFO L87 Difference]: Start difference. First operand 277 states and 305 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:49:43,669 INFO L93 Difference]: Finished difference Result 314 states and 319 transitions. [2025-03-17 15:49:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:49:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-17 15:49:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:49:43,673 INFO L225 Difference]: With dead ends: 314 [2025-03-17 15:49:43,673 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 15:49:43,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:49:43,674 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 120 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:49:43,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 963 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:49:43,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 15:49:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 278. [2025-03-17 15:49:43,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 183 states have (on average 1.5956284153005464) internal successors, (292), 267 states have internal predecessors, (292), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:49:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2025-03-17 15:49:43,683 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 55 [2025-03-17 15:49:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:49:43,683 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2025-03-17 15:49:43,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:49:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2025-03-17 15:49:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 15:49:43,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:49:43,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:49:43,690 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:49:43,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:49:43,888 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-17 15:49:43,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:49:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1292416557, now seen corresponding path program 1 times [2025-03-17 15:49:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:49:43,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519043814] [2025-03-17 15:49:43,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:49:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:49:43,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 15:49:43,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 15:49:43,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:49:43,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat