./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b23f88f1df76f11fbfc8e6288f4ade0e00ecdc2b8889a67f3774db6dfccf1d90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:37:38,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:37:38,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:37:38,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:37:38,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:37:38,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:37:38,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:37:38,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:37:38,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:37:38,125 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:37:38,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:37:38,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:37:38,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:37:38,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:37:38,126 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:37:38,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:37:38,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:37:38,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:37:38,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:37:38,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:37:38,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:37:38,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:37:38,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:37:38,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:37:38,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:37:38,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:37:38,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:37:38,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:37:38,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:37:38,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:37:38,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:37:38,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:37:38,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:37:38,129 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:37:38,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:37:38,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:37:38,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:37:38,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:37:38,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:37:38,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:37:38,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:37:38,130 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b23f88f1df76f11fbfc8e6288f4ade0e00ecdc2b8889a67f3774db6dfccf1d90 [2025-01-10 02:37:38,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:37:38,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:37:38,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:37:38,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:37:38,417 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:37:38,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c [2025-01-10 02:37:39,728 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/817213974/750b0370562d4800a9c7ee57ca476479/FLAG02479bb11 [2025-01-10 02:37:39,954 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:37:39,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_sqrt1.c [2025-01-10 02:37:39,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/817213974/750b0370562d4800a9c7ee57ca476479/FLAG02479bb11 [2025-01-10 02:37:39,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/817213974/750b0370562d4800a9c7ee57ca476479 [2025-01-10 02:37:39,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:37:39,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:37:39,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:37:39,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:37:39,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:37:39,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:37:39" (1/1) ... [2025-01-10 02:37:39,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d34c501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:39, skipping insertion in model container [2025-01-10 02:37:39,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:37:39" (1/1) ... [2025-01-10 02:37:39,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:37:40,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:37:40,160 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:37:40,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:37:40,203 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:37:40,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40 WrapperNode [2025-01-10 02:37:40,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:37:40,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:37:40,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:37:40,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:37:40,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,244 INFO L138 Inliner]: procedures = 16, calls = 67, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2025-01-10 02:37:40,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:37:40,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:37:40,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:37:40,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:37:40,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,286 INFO L175 MemorySlicer]: Split 41 memory accesses to 6 slices as follows [2, 12, 8, 9, 8, 2]. 29 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 0, 8, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 2, 2, 1]. [2025-01-10 02:37:40,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:37:40,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:37:40,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:37:40,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:37:40,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (1/1) ... [2025-01-10 02:37:40,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:37:40,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:40,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:37:40,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:37:40,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:37:40,379 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_39_0 [2025-01-10 02:37:40,379 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_39_0 [2025-01-10 02:37:40,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:37:40,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:37:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:37:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:37:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:37:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:37:40,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:37:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:37:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:37:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:37:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:37:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:37:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:37:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:37:40,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:37:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:37:40,469 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:37:40,471 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:37:40,879 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-01-10 02:37:40,879 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:37:40,893 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:37:40,894 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:37:40,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:37:40 BoogieIcfgContainer [2025-01-10 02:37:40,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:37:40,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:37:40,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:37:40,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:37:40,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:37:39" (1/3) ... [2025-01-10 02:37:40,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9fc920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:37:40, skipping insertion in model container [2025-01-10 02:37:40,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:40" (2/3) ... [2025-01-10 02:37:40,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9fc920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:37:40, skipping insertion in model container [2025-01-10 02:37:40,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:37:40" (3/3) ... [2025-01-10 02:37:40,902 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_sqrt1.c [2025-01-10 02:37:40,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:37:40,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_sqrt1.c that has 3 procedures, 131 locations, 1 initial locations, 0 loop locations, and 50 error locations. [2025-01-10 02:37:40,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:37:40,978 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;@1f9751a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:37:40,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 02:37:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 121 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:37:40,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:37:40,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:40,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:37:40,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:40,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1184608053, now seen corresponding path program 1 times [2025-01-10 02:37:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:40,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680593569] [2025-01-10 02:37:40,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:41,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:37:41,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:37:41,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:41,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:41,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680593569] [2025-01-10 02:37:41,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680593569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:41,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:41,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800716826] [2025-01-10 02:37:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:41,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:41,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:41,486 INFO L87 Difference]: Start difference. First operand has 131 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 121 states have internal predecessors, (123), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 4 states have (on average 1.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-01-10 02:37:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:41,718 INFO L93 Difference]: Finished difference Result 328 states and 365 transitions. [2025-01-10 02:37:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:41,721 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-01-10 02:37:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:41,727 INFO L225 Difference]: With dead ends: 328 [2025-01-10 02:37:41,729 INFO L226 Difference]: Without dead ends: 194 [2025-01-10 02:37:41,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:37:41,738 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 118 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:41,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 588 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-10 02:37:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 157. [2025-01-10 02:37:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.7340425531914894) internal successors, (163), 144 states have internal predecessors, (163), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-10 02:37:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2025-01-10 02:37:41,799 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 6 [2025-01-10 02:37:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:41,800 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2025-01-10 02:37:41,800 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-01-10 02:37:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2025-01-10 02:37:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:37:41,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:41,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:41,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:37:41,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_28_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1492751008, now seen corresponding path program 1 times [2025-01-10 02:37:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573043825] [2025-01-10 02:37:41,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:41,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:37:41,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:37:41,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:41,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573043825] [2025-01-10 02:37:42,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573043825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:42,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:42,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996337424] [2025-01-10 02:37:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:42,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:42,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:42,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:42,031 INFO L87 Difference]: Start difference. First operand 157 states and 184 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-01-10 02:37:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:42,172 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2025-01-10 02:37:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:42,172 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-01-10 02:37:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:42,174 INFO L225 Difference]: With dead ends: 194 [2025-01-10 02:37:42,174 INFO L226 Difference]: Without dead ends: 192 [2025-01-10 02:37:42,174 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-01-10 02:37:42,175 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 113 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:42,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 553 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-10 02:37:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2025-01-10 02:37:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.7127659574468086) internal successors, (161), 144 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-10 02:37:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2025-01-10 02:37:42,194 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 16 [2025-01-10 02:37:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:42,194 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2025-01-10 02:37:42,194 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-01-10 02:37:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2025-01-10 02:37:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 02:37:42,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:42,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:42,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:37:42,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_28_to_39_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:42,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash -14640318, now seen corresponding path program 1 times [2025-01-10 02:37:42,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:42,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522729836] [2025-01-10 02:37:42,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:42,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:42,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:37:42,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:37:42,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:42,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522729836] [2025-01-10 02:37:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522729836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:42,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:42,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:42,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922612002] [2025-01-10 02:37:42,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:42,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:42,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:42,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:42,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:42,367 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-01-10 02:37:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:42,520 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2025-01-10 02:37:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2025-01-10 02:37:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:42,522 INFO L225 Difference]: With dead ends: 192 [2025-01-10 02:37:42,522 INFO L226 Difference]: Without dead ends: 190 [2025-01-10 02:37:42,522 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-01-10 02:37:42,522 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:42,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 550 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-10 02:37:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 157. [2025-01-10 02:37:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 144 states have internal predecessors, (159), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-10 02:37:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2025-01-10 02:37:42,544 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 18 [2025-01-10 02:37:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:42,545 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2025-01-10 02:37:42,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-01-10 02:37:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2025-01-10 02:37:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:37:42,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:42,546 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-01-10 02:37:42,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:37:42,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_28_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:42,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1184442076, now seen corresponding path program 1 times [2025-01-10 02:37:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:42,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875370314] [2025-01-10 02:37:42,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:42,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:37:42,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:37:42,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:42,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:42,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230040474] [2025-01-10 02:37:42,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:42,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:42,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:42,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:37:42,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:37:42,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:37:42,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:37:42,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:42,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:42,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 02:37:42,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:42,728 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-01-10 02:37:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:42,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:42,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:42,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875370314] [2025-01-10 02:37:42,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230040474] [2025-01-10 02:37:42,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230040474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:42,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:42,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 02:37:42,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403811859] [2025-01-10 02:37:42,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:42,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:37:42,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:42,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:37:42,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:37:42,925 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-01-10 02:37:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:43,342 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2025-01-10 02:37:43,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:37:43,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-01-10 02:37:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:43,344 INFO L225 Difference]: With dead ends: 216 [2025-01-10 02:37:43,345 INFO L226 Difference]: Without dead ends: 214 [2025-01-10 02:37:43,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:37:43,346 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 170 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:43,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 976 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:37:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-10 02:37:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 157. [2025-01-10 02:37:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 94 states have (on average 1.6702127659574468) internal successors, (157), 144 states have internal predecessors, (157), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-10 02:37:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2025-01-10 02:37:43,359 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 20 [2025-01-10 02:37:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:43,359 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2025-01-10 02:37:43,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-01-10 02:37:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2025-01-10 02:37:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:37:43,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:43,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:43,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:37:43,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:43,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_28_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:43,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash -744717107, now seen corresponding path program 1 times [2025-01-10 02:37:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407202949] [2025-01-10 02:37:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:43,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:37:43,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:37:43,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:43,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:43,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474911517] [2025-01-10 02:37:43,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:43,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:43,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:43,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:37:43,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:37:43,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:37:43,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:37:43,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:43,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:43,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:37:43,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:43,699 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-01-10 02:37:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:37:43,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:43,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407202949] [2025-01-10 02:37:43,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474911517] [2025-01-10 02:37:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474911517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375854360] [2025-01-10 02:37:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:43,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:43,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:43,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:43,840 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-01-10 02:37:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:44,002 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2025-01-10 02:37:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:44,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 28 [2025-01-10 02:37:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:44,004 INFO L225 Difference]: With dead ends: 230 [2025-01-10 02:37:44,004 INFO L226 Difference]: Without dead ends: 229 [2025-01-10 02:37:44,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:37:44,005 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 181 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:44,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 516 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-10 02:37:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 175. [2025-01-10 02:37:44,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.6605504587155964) internal successors, (181), 159 states have internal predecessors, (181), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 206 transitions. [2025-01-10 02:37:44,015 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 206 transitions. Word has length 28 [2025-01-10 02:37:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:44,015 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 206 transitions. [2025-01-10 02:37:44,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-01-10 02:37:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 206 transitions. [2025-01-10 02:37:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-10 02:37:44,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:44,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:44,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:44,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:44,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_28_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:44,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:44,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1611393776, now seen corresponding path program 1 times [2025-01-10 02:37:44,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:44,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865103540] [2025-01-10 02:37:44,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:44,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:44,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:37:44,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:37:44,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:44,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931061741] [2025-01-10 02:37:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:44,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:37:44,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:37:44,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 02:37:44,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 02:37:44,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:44,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:44,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:37:44,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:44,343 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-01-10 02:37:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:37:44,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:44,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865103540] [2025-01-10 02:37:44,467 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931061741] [2025-01-10 02:37:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931061741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943476729] [2025-01-10 02:37:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:44,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:44,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:44,469 INFO L87 Difference]: Start difference. First operand 175 states and 206 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:37:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:44,622 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2025-01-10 02:37:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-01-10 02:37:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:44,624 INFO L225 Difference]: With dead ends: 229 [2025-01-10 02:37:44,624 INFO L226 Difference]: Without dead ends: 228 [2025-01-10 02:37:44,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:37:44,625 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:44,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 570 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-10 02:37:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 175. [2025-01-10 02:37:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.651376146788991) internal successors, (180), 159 states have internal predecessors, (180), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 205 transitions. [2025-01-10 02:37:44,639 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 205 transitions. Word has length 29 [2025-01-10 02:37:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:44,641 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 205 transitions. [2025-01-10 02:37:44,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:37:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2025-01-10 02:37:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:37:44,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:44,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:44,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:37:44,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:44,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_28_to_39_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1586400559, now seen corresponding path program 1 times [2025-01-10 02:37:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152398751] [2025-01-10 02:37:44,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:44,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:44,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:37:44,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:37:44,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:44,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:37:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152398751] [2025-01-10 02:37:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152398751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:45,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:45,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:45,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29155534] [2025-01-10 02:37:45,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:45,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:45,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:45,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:45,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:45,038 INFO L87 Difference]: Start difference. First operand 175 states and 205 transitions. Second operand has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-01-10 02:37:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:45,179 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2025-01-10 02:37:45,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:45,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 30 [2025-01-10 02:37:45,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:45,181 INFO L225 Difference]: With dead ends: 212 [2025-01-10 02:37:45,183 INFO L226 Difference]: Without dead ends: 210 [2025-01-10 02:37:45,184 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-01-10 02:37:45,185 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 121 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:45,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 527 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-10 02:37:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2025-01-10 02:37:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.6330275229357798) internal successors, (178), 159 states have internal predecessors, (178), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2025-01-10 02:37:45,196 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 30 [2025-01-10 02:37:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:45,197 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2025-01-10 02:37:45,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-01-10 02:37:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2025-01-10 02:37:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 02:37:45,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:45,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-01-10 02:37:45,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:37:45,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_28_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash -182450799, now seen corresponding path program 1 times [2025-01-10 02:37:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:45,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979478128] [2025-01-10 02:37:45,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:45,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:37:45,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:37:45,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:45,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021892077] [2025-01-10 02:37:45,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:45,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:45,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:37:45,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:37:45,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:37:45,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:37:45,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:45,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:45,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:37:45,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:45,316 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-01-10 02:37:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:37:45,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:45,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:45,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979478128] [2025-01-10 02:37:45,461 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021892077] [2025-01-10 02:37:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021892077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:45,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:45,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:37:45,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535751947] [2025-01-10 02:37:45,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:45,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:37:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:45,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:37:45,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:37:45,462 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 7 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-01-10 02:37:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:45,644 INFO L93 Difference]: Finished difference Result 226 states and 235 transitions. [2025-01-10 02:37:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:37:45,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 7 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-01-10 02:37:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:45,645 INFO L225 Difference]: With dead ends: 226 [2025-01-10 02:37:45,646 INFO L226 Difference]: Without dead ends: 225 [2025-01-10 02:37:45,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:37:45,646 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 209 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:45,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 453 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-01-10 02:37:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 175. [2025-01-10 02:37:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.6238532110091743) internal successors, (177), 159 states have internal predecessors, (177), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2025-01-10 02:37:45,662 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 32 [2025-01-10 02:37:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:45,662 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2025-01-10 02:37:45,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 7 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-01-10 02:37:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2025-01-10 02:37:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 02:37:45,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:45,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:45,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:37:45,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 02:37:45,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_28_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:45,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1361007404, now seen corresponding path program 1 times [2025-01-10 02:37:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280699377] [2025-01-10 02:37:45,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:45,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:45,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 02:37:45,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 02:37:45,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:45,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:37:46,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:46,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280699377] [2025-01-10 02:37:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280699377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:46,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:46,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107835095] [2025-01-10 02:37:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:46,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:46,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:46,125 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:37:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:46,276 INFO L93 Difference]: Finished difference Result 209 states and 219 transitions. [2025-01-10 02:37:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-01-10 02:37:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:46,280 INFO L225 Difference]: With dead ends: 209 [2025-01-10 02:37:46,280 INFO L226 Difference]: Without dead ends: 208 [2025-01-10 02:37:46,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:37:46,281 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 114 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:46,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 527 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-10 02:37:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 175. [2025-01-10 02:37:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.614678899082569) internal successors, (176), 159 states have internal predecessors, (176), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2025-01-10 02:37:46,289 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 33 [2025-01-10 02:37:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:46,290 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2025-01-10 02:37:46,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:37:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2025-01-10 02:37:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 02:37:46,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:46,291 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:46,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:37:46,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_28_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:46,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash 758443507, now seen corresponding path program 1 times [2025-01-10 02:37:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384333629] [2025-01-10 02:37:46,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:46,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:37:46,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:37:46,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:46,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:37:46,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384333629] [2025-01-10 02:37:46,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384333629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:46,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:46,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:46,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628702844] [2025-01-10 02:37:46,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:46,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:46,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:46,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:46,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:46,432 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-01-10 02:37:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:46,560 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2025-01-10 02:37:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:46,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 34 [2025-01-10 02:37:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:46,561 INFO L225 Difference]: With dead ends: 212 [2025-01-10 02:37:46,562 INFO L226 Difference]: Without dead ends: 210 [2025-01-10 02:37:46,562 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-01-10 02:37:46,563 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 103 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:46,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 533 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-10 02:37:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2025-01-10 02:37:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5963302752293578) internal successors, (174), 159 states have internal predecessors, (174), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2025-01-10 02:37:46,575 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 34 [2025-01-10 02:37:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:46,575 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2025-01-10 02:37:46,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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-01-10 02:37:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2025-01-10 02:37:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:37:46,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:46,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:46,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:37:46,577 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_28_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:46,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:46,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1280227755, now seen corresponding path program 1 times [2025-01-10 02:37:46,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:46,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732197897] [2025-01-10 02:37:46,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:46,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:37:46,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:37:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:37:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732197897] [2025-01-10 02:37:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732197897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:46,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:46,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564917024] [2025-01-10 02:37:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:46,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:46,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:46,747 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:37:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:46,916 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2025-01-10 02:37:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-01-10 02:37:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:46,917 INFO L225 Difference]: With dead ends: 210 [2025-01-10 02:37:46,917 INFO L226 Difference]: Without dead ends: 208 [2025-01-10 02:37:46,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:46,918 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 104 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:46,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 546 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-10 02:37:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 175. [2025-01-10 02:37:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5779816513761469) internal successors, (172), 159 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2025-01-10 02:37:46,933 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 197 transitions. Word has length 36 [2025-01-10 02:37:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:46,935 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 197 transitions. [2025-01-10 02:37:46,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:37:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 197 transitions. [2025-01-10 02:37:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:37:46,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:46,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:46,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:37:46,937 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_28_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:46,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1032354664, now seen corresponding path program 1 times [2025-01-10 02:37:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927058217] [2025-01-10 02:37:46,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:46,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:37:46,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:37:46,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:46,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:37:47,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:47,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927058217] [2025-01-10 02:37:47,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927058217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:47,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:47,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199465872] [2025-01-10 02:37:47,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:47,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:47,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:47,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:47,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:47,261 INFO L87 Difference]: Start difference. First operand 175 states and 197 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-01-10 02:37:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:47,586 INFO L93 Difference]: Finished difference Result 200 states and 210 transitions. [2025-01-10 02:37:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 37 [2025-01-10 02:37:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:47,589 INFO L225 Difference]: With dead ends: 200 [2025-01-10 02:37:47,589 INFO L226 Difference]: Without dead ends: 198 [2025-01-10 02:37:47,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:47,590 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 95 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:47,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 585 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:37:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-10 02:37:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2025-01-10 02:37:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 109 states have (on average 1.5596330275229358) internal successors, (170), 159 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2025-01-10 02:37:47,597 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 37 [2025-01-10 02:37:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:47,598 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2025-01-10 02:37:47,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-01-10 02:37:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2025-01-10 02:37:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:37:47,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:47,601 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-01-10 02:37:47,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:37:47,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_28_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:47,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:47,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2054185613, now seen corresponding path program 1 times [2025-01-10 02:37:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155488843] [2025-01-10 02:37:47,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:47,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:37:47,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:37:47,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:47,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155488843] [2025-01-10 02:37:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155488843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:47,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:47,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516398054] [2025-01-10 02:37:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:47,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:47,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:47,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:47,740 INFO L87 Difference]: Start difference. First operand 175 states and 195 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-01-10 02:37:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:47,826 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2025-01-10 02:37:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:47,827 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-01-10 02:37:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:47,829 INFO L225 Difference]: With dead ends: 185 [2025-01-10 02:37:47,829 INFO L226 Difference]: Without dead ends: 183 [2025-01-10 02:37:47,829 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-01-10 02:37:47,829 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:47,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 566 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-10 02:37:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2025-01-10 02:37:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 161 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2025-01-10 02:37:47,837 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 47 [2025-01-10 02:37:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:47,837 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2025-01-10 02:37:47,837 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-01-10 02:37:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2025-01-10 02:37:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:37:47,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:47,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:47,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:37:47,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_28_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:47,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1612579153, now seen corresponding path program 1 times [2025-01-10 02:37:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:47,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131300407] [2025-01-10 02:37:47,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:47,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:37:47,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:37:47,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:47,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131300407] [2025-01-10 02:37:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131300407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010004681] [2025-01-10 02:37:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:47,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:47,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:47,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:47,999 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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-01-10 02:37:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:48,094 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2025-01-10 02:37:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:48,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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 49 [2025-01-10 02:37:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:48,096 INFO L225 Difference]: With dead ends: 204 [2025-01-10 02:37:48,096 INFO L226 Difference]: Without dead ends: 202 [2025-01-10 02:37:48,096 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-01-10 02:37:48,097 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 72 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:48,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 561 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-10 02:37:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 179. [2025-01-10 02:37:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 163 states have internal predecessors, (174), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-01-10 02:37:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 199 transitions. [2025-01-10 02:37:48,106 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 199 transitions. Word has length 49 [2025-01-10 02:37:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:48,106 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 199 transitions. [2025-01-10 02:37:48,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 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-01-10 02:37:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 199 transitions. [2025-01-10 02:37:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 02:37:48,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:48,107 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-01-10 02:37:48,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:37:48,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:48,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1549267133, now seen corresponding path program 1 times [2025-01-10 02:37:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:48,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130185241] [2025-01-10 02:37:48,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:48,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:37:48,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:37:48,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:48,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:48,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130185241] [2025-01-10 02:37:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130185241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:48,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:37:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011961470] [2025-01-10 02:37:48,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:48,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:37:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:48,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:37:48,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:37:48,217 INFO L87 Difference]: Start difference. First operand 179 states and 199 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:48,315 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2025-01-10 02:37:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:37:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-10 02:37:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:48,317 INFO L225 Difference]: With dead ends: 187 [2025-01-10 02:37:48,317 INFO L226 Difference]: Without dead ends: 183 [2025-01-10 02:37:48,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:48,318 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:48,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 366 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-10 02:37:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2025-01-10 02:37:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 114 states have (on average 1.5) internal successors, (171), 164 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-10 02:37:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2025-01-10 02:37:48,332 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 50 [2025-01-10 02:37:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:48,332 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2025-01-10 02:37:48,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2025-01-10 02:37:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:37:48,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:48,333 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:48,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:37:48,333 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_28_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:48,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash 794630865, now seen corresponding path program 1 times [2025-01-10 02:37:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572509006] [2025-01-10 02:37:48,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:48,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:37:48,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:37:48,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:48,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572509006] [2025-01-10 02:37:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572509006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:48,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878755057] [2025-01-10 02:37:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:48,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:48,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:48,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:48,685 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:37:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:48,844 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2025-01-10 02:37:48,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:48,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-01-10 02:37:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:48,845 INFO L225 Difference]: With dead ends: 195 [2025-01-10 02:37:48,845 INFO L226 Difference]: Without dead ends: 194 [2025-01-10 02:37:48,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:37:48,846 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 60 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:48,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 621 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-10 02:37:48,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2025-01-10 02:37:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 165 states have internal predecessors, (172), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-10 02:37:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2025-01-10 02:37:48,855 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 51 [2025-01-10 02:37:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:48,855 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2025-01-10 02:37:48,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:37:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2025-01-10 02:37:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 02:37:48,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:48,856 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-01-10 02:37:48,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 02:37:48,856 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_28_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:48,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:48,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1136246862, now seen corresponding path program 1 times [2025-01-10 02:37:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:48,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753787188] [2025-01-10 02:37:48,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:48,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 02:37:48,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 02:37:48,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:48,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:49,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753787188] [2025-01-10 02:37:49,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753787188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:49,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101984643] [2025-01-10 02:37:49,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:49,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:49,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:49,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:49,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:49,170 INFO L87 Difference]: Start difference. First operand 182 states and 198 transitions. Second operand has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 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-01-10 02:37:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:49,321 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2025-01-10 02:37:49,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:49,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 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-01-10 02:37:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:49,322 INFO L225 Difference]: With dead ends: 195 [2025-01-10 02:37:49,322 INFO L226 Difference]: Without dead ends: 194 [2025-01-10 02:37:49,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:37:49,323 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 59 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:49,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 626 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-10 02:37:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 183. [2025-01-10 02:37:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 166 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-10 02:37:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2025-01-10 02:37:49,333 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 52 [2025-01-10 02:37:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:49,333 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2025-01-10 02:37:49,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.8) internal successors, (39), 6 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-01-10 02:37:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2025-01-10 02:37:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 02:37:49,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:49,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:49,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 02:37:49,336 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:49,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1423060323, now seen corresponding path program 1 times [2025-01-10 02:37:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:49,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933887511] [2025-01-10 02:37:49,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:49,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:49,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:37:49,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:37:49,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:49,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933887511] [2025-01-10 02:37:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933887511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:37:49,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935887593] [2025-01-10 02:37:49,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:49,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:49,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:49,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:37:49,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:37:49,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:37:49,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:37:49,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:49,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:49,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 02:37:49,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:49,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-01-10 02:37:50,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 02:37:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:50,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:37:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935887593] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:37:50,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:37:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-01-10 02:37:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122846646] [2025-01-10 02:37:50,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:37:50,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 02:37:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:50,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 02:37:50,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:37:50,248 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 17 states have internal predecessors, (119), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:37:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:50,603 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2025-01-10 02:37:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:37:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 17 states have internal predecessors, (119), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2025-01-10 02:37:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:50,605 INFO L225 Difference]: With dead ends: 188 [2025-01-10 02:37:50,605 INFO L226 Difference]: Without dead ends: 185 [2025-01-10 02:37:50,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2025-01-10 02:37:50,606 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 466 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:50,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1188 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-10 02:37:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2025-01-10 02:37:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 163 states have internal predecessors, (170), 12 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-01-10 02:37:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2025-01-10 02:37:50,616 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 56 [2025-01-10 02:37:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:50,616 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2025-01-10 02:37:50,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 17 states have internal predecessors, (119), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:37:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2025-01-10 02:37:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 02:37:50,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:50,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:50,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:50,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:37:50,818 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:50,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1165197016, now seen corresponding path program 1 times [2025-01-10 02:37:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:50,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008244567] [2025-01-10 02:37:50,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:50,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:37:50,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:37:50,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:50,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:51,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:51,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008244567] [2025-01-10 02:37:51,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008244567] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:37:51,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586708123] [2025-01-10 02:37:51,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:51,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:51,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:51,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:37:51,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:37:51,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:37:51,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:37:51,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:51,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:51,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 02:37:51,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:51,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:37:51,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-01-10 02:37:51,446 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-01-10 02:37:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:51,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:37:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:51,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586708123] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:37:51,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:37:51,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2025-01-10 02:37:51,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591970950] [2025-01-10 02:37:51,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:37:51,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 02:37:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:51,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 02:37:51,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:37:51,622 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand has 21 states, 17 states have (on average 6.823529411764706) internal successors, (116), 16 states have internal predecessors, (116), 8 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:37:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:51,986 INFO L93 Difference]: Finished difference Result 334 states and 356 transitions. [2025-01-10 02:37:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 02:37:51,986 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 6.823529411764706) internal successors, (116), 16 states have internal predecessors, (116), 8 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2025-01-10 02:37:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:51,988 INFO L225 Difference]: With dead ends: 334 [2025-01-10 02:37:51,988 INFO L226 Difference]: Without dead ends: 331 [2025-01-10 02:37:51,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2025-01-10 02:37:51,990 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 379 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:51,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1245 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-01-10 02:37:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 257. [2025-01-10 02:37:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.521978021978022) internal successors, (277), 230 states have internal predecessors, (277), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-10 02:37:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 323 transitions. [2025-01-10 02:37:52,006 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 323 transitions. Word has length 57 [2025-01-10 02:37:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:52,007 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 323 transitions. [2025-01-10 02:37:52,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 6.823529411764706) internal successors, (116), 16 states have internal predecessors, (116), 8 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:37:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 323 transitions. [2025-01-10 02:37:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 02:37:52,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:52,008 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:52,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:37:52,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:52,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:52,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1285119462, now seen corresponding path program 1 times [2025-01-10 02:37:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:52,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851783079] [2025-01-10 02:37:52,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:52,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:37:52,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:37:52,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:52,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:37:52,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851783079] [2025-01-10 02:37:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851783079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:52,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:52,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:37:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519911618] [2025-01-10 02:37:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:52,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:37:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:52,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:37:52,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:37:52,308 INFO L87 Difference]: Start difference. First operand 257 states and 323 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:37:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:52,413 INFO L93 Difference]: Finished difference Result 262 states and 324 transitions. [2025-01-10 02:37:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2025-01-10 02:37:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:52,416 INFO L225 Difference]: With dead ends: 262 [2025-01-10 02:37:52,416 INFO L226 Difference]: Without dead ends: 260 [2025-01-10 02:37:52,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:52,416 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:52,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 348 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-10 02:37:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2025-01-10 02:37:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.510989010989011) internal successors, (275), 230 states have internal predecessors, (275), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-10 02:37:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 321 transitions. [2025-01-10 02:37:52,428 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 321 transitions. Word has length 60 [2025-01-10 02:37:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:52,428 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 321 transitions. [2025-01-10 02:37:52,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:37:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 321 transitions. [2025-01-10 02:37:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 02:37:52,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:52,429 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:52,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 02:37:52,430 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:52,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1950782204, now seen corresponding path program 1 times [2025-01-10 02:37:52,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:52,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885191799] [2025-01-10 02:37:52,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:52,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:52,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 02:37:52,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 02:37:52,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:52,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:37:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885191799] [2025-01-10 02:37:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885191799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:52,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:37:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994779242] [2025-01-10 02:37:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:52,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:37:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:52,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:37:52,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:37:52,543 INFO L87 Difference]: Start difference. First operand 257 states and 321 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:37:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:52,638 INFO L93 Difference]: Finished difference Result 260 states and 322 transitions. [2025-01-10 02:37:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:37:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-01-10 02:37:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:52,640 INFO L225 Difference]: With dead ends: 260 [2025-01-10 02:37:52,640 INFO L226 Difference]: Without dead ends: 258 [2025-01-10 02:37:52,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:37:52,641 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 29 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:52,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 343 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-10 02:37:52,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2025-01-10 02:37:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.5) internal successors, (273), 230 states have internal predecessors, (273), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-10 02:37:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 319 transitions. [2025-01-10 02:37:52,655 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 319 transitions. Word has length 62 [2025-01-10 02:37:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:52,655 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 319 transitions. [2025-01-10 02:37:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:37:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 319 transitions. [2025-01-10 02:37:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:37:52,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:52,656 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:52,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 02:37:52,657 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:52,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2095961054, now seen corresponding path program 1 times [2025-01-10 02:37:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:52,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423263332] [2025-01-10 02:37:52,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:52,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:37:52,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:37:52,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:52,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41663699] [2025-01-10 02:37:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:52,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:52,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:37:52,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:37:52,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:37:52,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:37:52,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:52,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:52,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 02:37:52,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:52,786 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-01-10 02:37:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:37:52,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423263332] [2025-01-10 02:37:52,896 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41663699] [2025-01-10 02:37:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41663699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:52,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751458619] [2025-01-10 02:37:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:52,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:52,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:52,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:52,898 INFO L87 Difference]: Start difference. First operand 257 states and 319 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:37:53,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:53,068 INFO L93 Difference]: Finished difference Result 284 states and 343 transitions. [2025-01-10 02:37:53,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:37:53,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2025-01-10 02:37:53,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:53,071 INFO L225 Difference]: With dead ends: 284 [2025-01-10 02:37:53,071 INFO L226 Difference]: Without dead ends: 282 [2025-01-10 02:37:53,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:37:53,072 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 92 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:53,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 535 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-10 02:37:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 257. [2025-01-10 02:37:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 182 states have (on average 1.489010989010989) internal successors, (271), 230 states have internal predecessors, (271), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-10 02:37:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 317 transitions. [2025-01-10 02:37:53,090 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 317 transitions. Word has length 64 [2025-01-10 02:37:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:53,091 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 317 transitions. [2025-01-10 02:37:53,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:37:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 317 transitions. [2025-01-10 02:37:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 02:37:53,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:53,091 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:53,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:37:53,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:53,292 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_28_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:53,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash 322785458, now seen corresponding path program 1 times [2025-01-10 02:37:53,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9558224] [2025-01-10 02:37:53,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:53,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 02:37:53,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 02:37:53,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:53,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 02:37:53,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9558224] [2025-01-10 02:37:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9558224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:53,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424048480] [2025-01-10 02:37:53,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:53,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:53,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:53,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:53,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:53,367 INFO L87 Difference]: Start difference. First operand 257 states and 317 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:53,436 INFO L93 Difference]: Finished difference Result 257 states and 317 transitions. [2025-01-10 02:37:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-01-10 02:37:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:53,438 INFO L225 Difference]: With dead ends: 257 [2025-01-10 02:37:53,438 INFO L226 Difference]: Without dead ends: 256 [2025-01-10 02:37:53,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:53,439 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:53,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 369 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-10 02:37:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-01-10 02:37:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 182 states have (on average 1.4725274725274726) internal successors, (268), 229 states have internal predecessors, (268), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-10 02:37:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 314 transitions. [2025-01-10 02:37:53,453 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 314 transitions. Word has length 66 [2025-01-10 02:37:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:53,453 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 314 transitions. [2025-01-10 02:37:53,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 314 transitions. [2025-01-10 02:37:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 02:37:53,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:53,454 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:53,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 02:37:53,454 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_28_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:53,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1416414653, now seen corresponding path program 1 times [2025-01-10 02:37:53,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:53,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514048941] [2025-01-10 02:37:53,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:53,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:37:53,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:37:53,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:53,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 02:37:53,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:53,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514048941] [2025-01-10 02:37:53,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514048941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:53,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:53,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520368418] [2025-01-10 02:37:53,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:53,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:53,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:53,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:53,527 INFO L87 Difference]: Start difference. First operand 256 states and 314 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:53,591 INFO L93 Difference]: Finished difference Result 256 states and 314 transitions. [2025-01-10 02:37:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:53,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2025-01-10 02:37:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:53,592 INFO L225 Difference]: With dead ends: 256 [2025-01-10 02:37:53,592 INFO L226 Difference]: Without dead ends: 255 [2025-01-10 02:37:53,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:53,593 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 49 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:53,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 369 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:37:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-10 02:37:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-01-10 02:37:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 182 states have (on average 1.456043956043956) internal successors, (265), 228 states have internal predecessors, (265), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-10 02:37:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 311 transitions. [2025-01-10 02:37:53,628 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 311 transitions. Word has length 67 [2025-01-10 02:37:53,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:53,628 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 311 transitions. [2025-01-10 02:37:53,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 311 transitions. [2025-01-10 02:37:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 02:37:53,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:53,629 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:53,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 02:37:53,630 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_28_to_39_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:53,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 959181332, now seen corresponding path program 1 times [2025-01-10 02:37:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361177394] [2025-01-10 02:37:53,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:53,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 02:37:53,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:37:53,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 02:37:53,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:53,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361177394] [2025-01-10 02:37:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361177394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:53,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522965578] [2025-01-10 02:37:53,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:53,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:53,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:53,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:53,700 INFO L87 Difference]: Start difference. First operand 255 states and 311 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:53,767 INFO L93 Difference]: Finished difference Result 255 states and 311 transitions. [2025-01-10 02:37:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-01-10 02:37:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:53,769 INFO L225 Difference]: With dead ends: 255 [2025-01-10 02:37:53,771 INFO L226 Difference]: Without dead ends: 254 [2025-01-10 02:37:53,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:53,772 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 44 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:53,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 364 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-10 02:37:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-01-10 02:37:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 182 states have (on average 1.4395604395604396) internal successors, (262), 227 states have internal predecessors, (262), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-10 02:37:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 308 transitions. [2025-01-10 02:37:53,787 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 308 transitions. Word has length 68 [2025-01-10 02:37:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:53,788 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 308 transitions. [2025-01-10 02:37:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 308 transitions. [2025-01-10 02:37:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-10 02:37:53,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:53,789 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 02:37:53,789 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_28_to_39_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:53,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash -330149729, now seen corresponding path program 1 times [2025-01-10 02:37:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977580514] [2025-01-10 02:37:53,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:53,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:53,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 02:37:53,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 02:37:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 02:37:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977580514] [2025-01-10 02:37:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977580514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:53,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:53,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103664852] [2025-01-10 02:37:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:53,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:53,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:53,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:53,869 INFO L87 Difference]: Start difference. First operand 254 states and 308 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:53,951 INFO L93 Difference]: Finished difference Result 254 states and 308 transitions. [2025-01-10 02:37:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2025-01-10 02:37:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:53,952 INFO L225 Difference]: With dead ends: 254 [2025-01-10 02:37:53,952 INFO L226 Difference]: Without dead ends: 253 [2025-01-10 02:37:53,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:53,953 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 41 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:53,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 456 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-10 02:37:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-01-10 02:37:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 182 states have (on average 1.4230769230769231) internal successors, (259), 226 states have internal predecessors, (259), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-01-10 02:37:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2025-01-10 02:37:53,964 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 69 [2025-01-10 02:37:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:53,964 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2025-01-10 02:37:53,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:37:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2025-01-10 02:37:53,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:37:53,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:53,965 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:53,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 02:37:53,966 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_28_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_28_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_28_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 48 more)] === [2025-01-10 02:37:53,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1644706954, now seen corresponding path program 1 times [2025-01-10 02:37:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:53,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356223739] [2025-01-10 02:37:53,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:53,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:53,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:37:53,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:37:53,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:53,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:53,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656426398] [2025-01-10 02:37:53,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:53,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:53,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:53,995 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:37:53,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:37:54,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:37:54,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:37:54,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:54,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:54,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 02:37:54,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:54,125 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-01-10 02:37:54,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 02:37:54,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2025-01-10 02:37:55,688 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 39 treesize of output 19 [2025-01-10 02:37:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:55,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:37:55,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:55,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356223739] [2025-01-10 02:37:55,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:55,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656426398] [2025-01-10 02:37:55,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656426398] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:37:55,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:37:55,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-01-10 02:37:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87645571] [2025-01-10 02:37:55,909 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:37:55,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 02:37:55,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:55,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 02:37:55,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:37:55,911 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 18 states, 16 states have (on average 3.75) internal successors, (60), 16 states have internal predecessors, (60), 5 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:37:59,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:04,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:12,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:16,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:20,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:24,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:36,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:40,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:44,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:52,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:38:56,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:39:00,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:39:09,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:39:13,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]