./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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_cohencu.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 ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:31:28,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:31:28,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:31:28,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:31:28,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:31:28,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:31:28,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:31:28,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:31:28,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:31:28,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:31:28,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:31:28,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:31:28,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:31:28,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:31:28,525 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:31:28,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:31:28,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:31:28,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:31:28,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:31:28,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:31:28,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:31:28,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:31:28,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:31:28,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:31:28,526 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:31:28,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:31:28,526 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:31:28,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:31:28,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:31:28,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:31:28,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:31:28,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:31:28,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:31:28,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:31:28,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:31:28,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:31:28,528 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 -> ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e [2025-03-04 11:31:28,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:31:28,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:31:28,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:31:28,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:31:28,758 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:31:28,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2025-03-04 11:31:29,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962d5a310/dce9f13148db45a3aa70030464909618/FLAGc8c1bcd5c [2025-03-04 11:31:30,142 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:31:30,143 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2025-03-04 11:31:30,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962d5a310/dce9f13148db45a3aa70030464909618/FLAGc8c1bcd5c [2025-03-04 11:31:30,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/962d5a310/dce9f13148db45a3aa70030464909618 [2025-03-04 11:31:30,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:31:30,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:31:30,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:31:30,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:31:30,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:31:30,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ef4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30, skipping insertion in model container [2025-03-04 11:31:30,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:31:30,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:31:30,285 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:31:30,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:31:30,318 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:31:30,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30 WrapperNode [2025-03-04 11:31:30,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:31:30,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:31:30,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:31:30,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:31:30,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,360 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2025-03-04 11:31:30,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:31:30,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:31:30,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:31:30,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:31:30,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,395 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 12, 5, 21, 11, 15]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 2, 1, 2, 2, 2]. [2025-03-04 11:31:30,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:31:30,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:31:30,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:31:30,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:31:30,419 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (1/1) ... [2025-03-04 11:31:30,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:31:30,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:30,448 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-04 11:31:30,451 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-04 11:31:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:31:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:31:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:31:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:31:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:31:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:31:30,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:31:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:31:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:31:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:31:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:31:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:31:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:31:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:31:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_39_0 [2025-03-04 11:31:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_39_0 [2025-03-04 11:31:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:31:30,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:31:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:31:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:31:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:31:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:31:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:31:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:31:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:31:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:31:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:31:30,541 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:31:30,542 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:31:31,105 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#z~0#1.base, main_~#z~0#1.offset);havoc main_~#z~0#1.base, main_~#z~0#1.offset; [2025-03-04 11:31:31,139 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2025-03-04 11:31:31,139 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:31:31,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:31:31,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:31:31,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:31:31 BoogieIcfgContainer [2025-03-04 11:31:31,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:31:31,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:31:31,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:31:31,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:31:31,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:31:30" (1/3) ... [2025-03-04 11:31:31,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0e5d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:31:31, skipping insertion in model container [2025-03-04 11:31:31,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:30" (2/3) ... [2025-03-04 11:31:31,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0e5d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:31:31, skipping insertion in model container [2025-03-04 11:31:31,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:31:31" (3/3) ... [2025-03-04 11:31:31,163 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_cohencu.c [2025-03-04 11:31:31,174 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:31:31,176 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_cohencu.c that has 3 procedures, 317 locations, 1 initial locations, 0 loop locations, and 138 error locations. [2025-03-04 11:31:31,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:31:31,236 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;@a834fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:31:31,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-03-04 11:31:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 11:31:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:31:31,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:31,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:31:31,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:31,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:31,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1557033859, now seen corresponding path program 1 times [2025-03-04 11:31:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:31,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543686640] [2025-03-04 11:31:31,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:31,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:31,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:31:31,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:31:31,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:31,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:31,626 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-04 11:31:31,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543686640] [2025-03-04 11:31:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543686640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:31,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:31,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322449414] [2025-03-04 11:31:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:31,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:31,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:31,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:31,645 INFO L87 Difference]: Start difference. First operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-04 11:31:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:31,830 INFO L93 Difference]: Finished difference Result 738 states and 792 transitions. [2025-03-04 11:31:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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 6 [2025-03-04 11:31:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:31,841 INFO L225 Difference]: With dead ends: 738 [2025-03-04 11:31:31,841 INFO L226 Difference]: Without dead ends: 418 [2025-03-04 11:31:31,844 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-04 11:31:31,845 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 205 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:31,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1530 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-04 11:31:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 371. [2025-03-04 11:31:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8497652582159625) internal successors, (394), 351 states have internal predecessors, (394), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 11:31:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2025-03-04 11:31:31,891 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 6 [2025-03-04 11:31:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:31,891 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2025-03-04 11:31:31,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-04 11:31:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2025-03-04 11:31:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:31:31,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:31,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:31,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:31:31,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:31,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash 527372962, now seen corresponding path program 1 times [2025-03-04 11:31:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:31,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409204741] [2025-03-04 11:31:31,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:31,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:31,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:31:31,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:31:31,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:31,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:32,104 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-04 11:31:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:32,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409204741] [2025-03-04 11:31:32,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409204741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:32,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:32,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:32,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101780352] [2025-03-04 11:31:32,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:32,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:32,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:32,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:32,107 INFO L87 Difference]: Start difference. First operand 371 states and 429 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-04 11:31:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:32,246 INFO L93 Difference]: Finished difference Result 418 states and 434 transitions. [2025-03-04 11:31:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:32,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2025-03-04 11:31:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:32,249 INFO L225 Difference]: With dead ends: 418 [2025-03-04 11:31:32,249 INFO L226 Difference]: Without dead ends: 414 [2025-03-04 11:31:32,249 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-04 11:31:32,249 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 200 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:32,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1479 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:32,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-04 11:31:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 371. [2025-03-04 11:31:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8309859154929577) internal successors, (390), 351 states have internal predecessors, (390), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 11:31:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2025-03-04 11:31:32,265 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 16 [2025-03-04 11:31:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:32,265 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2025-03-04 11:31:32,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-04 11:31:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2025-03-04 11:31:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 11:31:32,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:32,266 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] [2025-03-04 11:31:32,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:31:32,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:32,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash -693762722, now seen corresponding path program 1 times [2025-03-04 11:31:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:32,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994231956] [2025-03-04 11:31:32,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:32,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:31:32,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:31:32,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:32,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:32,440 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-04 11:31:32,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:32,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994231956] [2025-03-04 11:31:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994231956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:32,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:32,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479692753] [2025-03-04 11:31:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:32,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:32,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:32,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:32,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:32,442 INFO L87 Difference]: Start difference. First operand 371 states and 425 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-04 11:31:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:32,571 INFO L93 Difference]: Finished difference Result 414 states and 430 transitions. [2025-03-04 11:31:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:32,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 20 [2025-03-04 11:31:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:32,574 INFO L225 Difference]: With dead ends: 414 [2025-03-04 11:31:32,574 INFO L226 Difference]: Without dead ends: 412 [2025-03-04 11:31:32,574 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-04 11:31:32,575 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 186 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:32,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1481 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-04 11:31:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 371. [2025-03-04 11:31:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8215962441314555) internal successors, (388), 351 states have internal predecessors, (388), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 11:31:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2025-03-04 11:31:32,594 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 20 [2025-03-04 11:31:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:32,595 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2025-03-04 11:31:32,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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-04 11:31:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2025-03-04 11:31:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 11:31:32,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:32,596 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] [2025-03-04 11:31:32,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:31:32,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:32,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash -986042692, now seen corresponding path program 1 times [2025-03-04 11:31:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:32,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338862228] [2025-03-04 11:31:32,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:32,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:32,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 11:31:32,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 11:31:32,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:32,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:32,759 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-04 11:31:32,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338862228] [2025-03-04 11:31:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338862228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:32,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:32,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:32,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468582968] [2025-03-04 11:31:32,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:32,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:32,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:32,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:32,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:32,762 INFO L87 Difference]: Start difference. First operand 371 states and 423 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-04 11:31:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:32,904 INFO L93 Difference]: Finished difference Result 412 states and 428 transitions. [2025-03-04 11:31:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:32,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 22 [2025-03-04 11:31:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:32,906 INFO L225 Difference]: With dead ends: 412 [2025-03-04 11:31:32,906 INFO L226 Difference]: Without dead ends: 410 [2025-03-04 11:31:32,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:31:32,907 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 188 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:32,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1549 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-04 11:31:32,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2025-03-04 11:31:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.812206572769953) internal successors, (386), 351 states have internal predecessors, (386), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 11:31:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 421 transitions. [2025-03-04 11:31:32,920 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 421 transitions. Word has length 22 [2025-03-04 11:31:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:32,920 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 421 transitions. [2025-03-04 11:31:32,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-04 11:31:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 421 transitions. [2025-03-04 11:31:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:31:32,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:32,921 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-04 11:31:32,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:31:32,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:32,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash -502552313, now seen corresponding path program 1 times [2025-03-04 11:31:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041368720] [2025-03-04 11:31:32,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:32,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:31:32,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:31:32,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:32,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:33,068 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-04 11:31:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:33,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041368720] [2025-03-04 11:31:33,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041368720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:33,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:33,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038775366] [2025-03-04 11:31:33,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:33,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:33,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:33,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:33,070 INFO L87 Difference]: Start difference. First operand 371 states and 421 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-04 11:31:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:33,187 INFO L93 Difference]: Finished difference Result 410 states and 426 transitions. [2025-03-04 11:31:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 23 [2025-03-04 11:31:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:33,189 INFO L225 Difference]: With dead ends: 410 [2025-03-04 11:31:33,189 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 11:31:33,189 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-04 11:31:33,190 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 175 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:33,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1483 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 11:31:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 371. [2025-03-04 11:31:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8028169014084507) internal successors, (384), 351 states have internal predecessors, (384), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-04 11:31:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 419 transitions. [2025-03-04 11:31:33,197 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 419 transitions. Word has length 23 [2025-03-04 11:31:33,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:33,197 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 419 transitions. [2025-03-04 11:31:33,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-04 11:31:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 419 transitions. [2025-03-04 11:31:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:31:33,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:33,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:33,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:31:33,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:33,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1614887917, now seen corresponding path program 1 times [2025-03-04 11:31:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-03-04 11:31:33,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:33,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:31:33,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:31:33,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:33,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433291539] [2025-03-04 11:31:33,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:33,222 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-04 11:31:33,223 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-04 11:31:33,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:31:33,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:31:33,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:33,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:33,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:31:33,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:33,326 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-04 11:31:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:31:33,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:33,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395695518] [2025-03-04 11:31:33,443 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433291539] [2025-03-04 11:31:33,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433291539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:33,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:33,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534511035] [2025-03-04 11:31:33,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:33,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:33,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:33,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:33,444 INFO L87 Difference]: Start difference. First operand 371 states and 419 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:31:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:33,592 INFO L93 Difference]: Finished difference Result 590 states and 609 transitions. [2025-03-04 11:31:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-04 11:31:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:33,595 INFO L225 Difference]: With dead ends: 590 [2025-03-04 11:31:33,595 INFO L226 Difference]: Without dead ends: 586 [2025-03-04 11:31:33,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:31:33,597 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 344 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:33,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1768 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-04 11:31:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 453. [2025-03-04 11:31:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8131487889273357) internal successors, (524), 427 states have internal predecessors, (524), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2025-03-04 11:31:33,612 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 32 [2025-03-04 11:31:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:33,613 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2025-03-04 11:31:33,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:31:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2025-03-04 11:31:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:31:33,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:33,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:33,621 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-04 11:31:33,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 11:31:33,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:33,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:33,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1832861348, now seen corresponding path program 1 times [2025-03-04 11:31:33,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:33,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303395392] [2025-03-04 11:31:33,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:33,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:33,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:31:33,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:31:33,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:33,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:33,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520928212] [2025-03-04 11:31:33,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:33,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:33,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:33,844 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-04 11:31:33,845 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-04 11:31:33,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:31:33,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:31:33,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:33,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:33,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 11:31:33,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:33,949 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-04 11:31:33,954 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-04 11:31:34,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:31:34,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:34,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:34,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303395392] [2025-03-04 11:31:34,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:34,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520928212] [2025-03-04 11:31:34,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520928212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:34,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:34,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 11:31:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283640281] [2025-03-04 11:31:34,502 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:34,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:31:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:34,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:31:34,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:31:34,503 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:31:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:35,279 INFO L93 Difference]: Finished difference Result 594 states and 613 transitions. [2025-03-04 11:31:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:31:35,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-03-04 11:31:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:35,283 INFO L225 Difference]: With dead ends: 594 [2025-03-04 11:31:35,283 INFO L226 Difference]: Without dead ends: 593 [2025-03-04 11:31:35,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:31:35,284 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 449 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:35,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 2866 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:31:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-04 11:31:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 453. [2025-03-04 11:31:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8096885813148789) internal successors, (523), 427 states have internal predecessors, (523), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 568 transitions. [2025-03-04 11:31:35,305 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 568 transitions. Word has length 42 [2025-03-04 11:31:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:35,306 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 568 transitions. [2025-03-04 11:31:35,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:31:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 568 transitions. [2025-03-04 11:31:35,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:31:35,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:35,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:35,314 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-04 11:31:35,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 11:31:35,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:35,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash 984126987, now seen corresponding path program 1 times [2025-03-04 11:31:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:35,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135332934] [2025-03-04 11:31:35,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:35,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:31:35,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:31:35,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:35,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324767857] [2025-03-04 11:31:35,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:35,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:35,534 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-04 11:31:35,535 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-04 11:31:35,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:31:35,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:31:35,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:35,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:35,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 11:31:35,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:35,610 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-04 11:31:35,613 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-04 11:31:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:31:35,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:36,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135332934] [2025-03-04 11:31:36,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324767857] [2025-03-04 11:31:36,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324767857] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:36,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:36,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 11:31:36,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104775278] [2025-03-04 11:31:36,068 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:36,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:31:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:36,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:31:36,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:31:36,069 INFO L87 Difference]: Start difference. First operand 453 states and 568 transitions. Second operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:31:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:36,726 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2025-03-04 11:31:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:31:36,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-04 11:31:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:36,728 INFO L225 Difference]: With dead ends: 593 [2025-03-04 11:31:36,728 INFO L226 Difference]: Without dead ends: 592 [2025-03-04 11:31:36,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:31:36,729 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 626 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:36,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 2313 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:31:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-04 11:31:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 453. [2025-03-04 11:31:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.806228373702422) internal successors, (522), 427 states have internal predecessors, (522), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:36,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 567 transitions. [2025-03-04 11:31:36,758 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 567 transitions. Word has length 43 [2025-03-04 11:31:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:36,758 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 567 transitions. [2025-03-04 11:31:36,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:31:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 567 transitions. [2025-03-04 11:31:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:31:36,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:36,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:36,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:31:36,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:36,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 443165570, now seen corresponding path program 1 times [2025-03-04 11:31:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44474343] [2025-03-04 11:31:36,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:36,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:31:36,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:31:36,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:36,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:31:37,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44474343] [2025-03-04 11:31:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44474343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:37,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:37,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481400594] [2025-03-04 11:31:37,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:37,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:37,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:37,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:37,088 INFO L87 Difference]: Start difference. First operand 453 states and 567 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:37,236 INFO L93 Difference]: Finished difference Result 560 states and 580 transitions. [2025-03-04 11:31:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:37,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-04 11:31:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:37,238 INFO L225 Difference]: With dead ends: 560 [2025-03-04 11:31:37,239 INFO L226 Difference]: Without dead ends: 558 [2025-03-04 11:31:37,239 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-04 11:31:37,240 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 313 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:37,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1431 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-04 11:31:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 453. [2025-03-04 11:31:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7993079584775087) internal successors, (520), 427 states have internal predecessors, (520), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 565 transitions. [2025-03-04 11:31:37,254 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 565 transitions. Word has length 44 [2025-03-04 11:31:37,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:37,254 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 565 transitions. [2025-03-04 11:31:37,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 565 transitions. [2025-03-04 11:31:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:31:37,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:37,257 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:37,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:31:37,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:37,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash 680351840, now seen corresponding path program 1 times [2025-03-04 11:31:37,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:37,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644482469] [2025-03-04 11:31:37,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:37,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:31:37,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:31:37,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:37,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:31:37,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:37,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644482469] [2025-03-04 11:31:37,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644482469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:37,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:37,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:37,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070070914] [2025-03-04 11:31:37,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:37,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:37,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:37,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:37,410 INFO L87 Difference]: Start difference. First operand 453 states and 565 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:37,641 INFO L93 Difference]: Finished difference Result 558 states and 578 transitions. [2025-03-04 11:31:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:37,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-04 11:31:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:37,643 INFO L225 Difference]: With dead ends: 558 [2025-03-04 11:31:37,643 INFO L226 Difference]: Without dead ends: 557 [2025-03-04 11:31:37,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:31:37,644 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 309 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:37,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1695 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-04 11:31:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 453. [2025-03-04 11:31:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7958477508650519) internal successors, (519), 427 states have internal predecessors, (519), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 564 transitions. [2025-03-04 11:31:37,660 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 564 transitions. Word has length 46 [2025-03-04 11:31:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:37,660 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 564 transitions. [2025-03-04 11:31:37,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 564 transitions. [2025-03-04 11:31:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:31:37,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:37,661 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:37,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:31:37,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:37,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash -383929401, now seen corresponding path program 1 times [2025-03-04 11:31:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:37,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124314665] [2025-03-04 11:31:37,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:37,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:31:37,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:31:37,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:37,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:31:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124314665] [2025-03-04 11:31:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124314665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653585032] [2025-03-04 11:31:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:37,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:37,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:37,800 INFO L87 Difference]: Start difference. First operand 453 states and 564 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:38,004 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2025-03-04 11:31:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:38,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-04 11:31:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:38,006 INFO L225 Difference]: With dead ends: 557 [2025-03-04 11:31:38,007 INFO L226 Difference]: Without dead ends: 556 [2025-03-04 11:31:38,007 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-04 11:31:38,007 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 306 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:38,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-04 11:31:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2025-03-04 11:31:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.792387543252595) internal successors, (518), 427 states have internal predecessors, (518), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 563 transitions. [2025-03-04 11:31:38,018 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 563 transitions. Word has length 47 [2025-03-04 11:31:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:38,018 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 563 transitions. [2025-03-04 11:31:38,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 563 transitions. [2025-03-04 11:31:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:31:38,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:38,018 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:38,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:31:38,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:38,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash 983090494, now seen corresponding path program 1 times [2025-03-04 11:31:38,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12291119] [2025-03-04 11:31:38,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:38,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:38,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:31:38,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:31:38,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:38,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:31:38,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:38,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12291119] [2025-03-04 11:31:38,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12291119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:38,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:38,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:38,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717982211] [2025-03-04 11:31:38,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:38,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:38,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:38,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:38,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:38,119 INFO L87 Difference]: Start difference. First operand 453 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:38,262 INFO L93 Difference]: Finished difference Result 568 states and 588 transitions. [2025-03-04 11:31:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-04 11:31:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:38,264 INFO L225 Difference]: With dead ends: 568 [2025-03-04 11:31:38,264 INFO L226 Difference]: Without dead ends: 566 [2025-03-04 11:31:38,264 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-04 11:31:38,265 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 311 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:38,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1423 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-04 11:31:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2025-03-04 11:31:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7854671280276817) internal successors, (516), 427 states have internal predecessors, (516), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 561 transitions. [2025-03-04 11:31:38,277 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 561 transitions. Word has length 48 [2025-03-04 11:31:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:38,277 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 561 transitions. [2025-03-04 11:31:38,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 561 transitions. [2025-03-04 11:31:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:31:38,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:38,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:38,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:31:38,278 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:38,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash -142839268, now seen corresponding path program 1 times [2025-03-04 11:31:38,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:38,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531162461] [2025-03-04 11:31:38,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:38,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:38,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:31:38,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:31:38,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:38,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:38,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826684702] [2025-03-04 11:31:38,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:38,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:38,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:38,295 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-04 11:31:38,297 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-04 11:31:38,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:31:38,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:31:38,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:38,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:38,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 11:31:38,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:38,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:38,376 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-04 11:31:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:31:38,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:39,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531162461] [2025-03-04 11:31:39,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826684702] [2025-03-04 11:31:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826684702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:39,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-04 11:31:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329400444] [2025-03-04 11:31:39,111 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:39,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:31:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:39,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:31:39,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:31:39,113 INFO L87 Difference]: Start difference. First operand 453 states and 561 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:31:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:40,252 INFO L93 Difference]: Finished difference Result 586 states and 605 transitions. [2025-03-04 11:31:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:31:40,253 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2025-03-04 11:31:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:40,256 INFO L225 Difference]: With dead ends: 586 [2025-03-04 11:31:40,256 INFO L226 Difference]: Without dead ends: 584 [2025-03-04 11:31:40,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:31:40,258 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 605 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:40,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 3160 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:31:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-04 11:31:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 453. [2025-03-04 11:31:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.778546712802768) internal successors, (514), 427 states have internal predecessors, (514), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 559 transitions. [2025-03-04 11:31:40,273 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 559 transitions. Word has length 50 [2025-03-04 11:31:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:40,273 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 559 transitions. [2025-03-04 11:31:40,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:31:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 559 transitions. [2025-03-04 11:31:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:31:40,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:40,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:40,283 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-04 11:31:40,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:40,475 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash 170417914, now seen corresponding path program 1 times [2025-03-04 11:31:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031932003] [2025-03-04 11:31:40,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:40,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:40,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:31:40,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:31:40,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:40,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:31:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031932003] [2025-03-04 11:31:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031932003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:40,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:40,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:40,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765975068] [2025-03-04 11:31:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:40,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:40,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:40,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:40,606 INFO L87 Difference]: Start difference. First operand 453 states and 559 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:40,752 INFO L93 Difference]: Finished difference Result 576 states and 596 transitions. [2025-03-04 11:31:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-04 11:31:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:40,754 INFO L225 Difference]: With dead ends: 576 [2025-03-04 11:31:40,755 INFO L226 Difference]: Without dead ends: 574 [2025-03-04 11:31:40,755 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-04 11:31:40,755 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 309 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:40,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-04 11:31:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 453. [2025-03-04 11:31:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7716262975778547) internal successors, (512), 427 states have internal predecessors, (512), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-04 11:31:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 557 transitions. [2025-03-04 11:31:40,769 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 557 transitions. Word has length 52 [2025-03-04 11:31:40,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:40,769 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 557 transitions. [2025-03-04 11:31:40,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:31:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 557 transitions. [2025-03-04 11:31:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:31:40,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:40,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:40,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:31:40,771 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-04 11:31:40,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:40,771 INFO L85 PathProgramCache]: Analyzing trace with hash 562858968, now seen corresponding path program 1 times [2025-03-04 11:31:40,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:40,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422744218] [2025-03-04 11:31:40,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:40,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:40,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:31:40,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:31:40,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:40,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat