./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps6.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_ps6.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 635e58724a56c62caeff3bee7749decbe4fed7f75c2f747c3a69f15f74dc7ff3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:37:15,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:37:15,399 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:15,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:37:15,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:37:15,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:37:15,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:37:15,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:37:15,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:37:15,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:37:15,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:37:15,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:37:15,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:37:15,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:37:15,429 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:37:15,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:37:15,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:37:15,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:37:15,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:37:15,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:37:15,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:37:15,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:37:15,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:37:15,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:37:15,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:37:15,432 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 -> 635e58724a56c62caeff3bee7749decbe4fed7f75c2f747c3a69f15f74dc7ff3 [2025-01-10 02:37:15,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:37:15,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:37:15,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:37:15,631 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:37:15,631 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:37:15,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps6.c [2025-01-10 02:37:16,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7771e70fa/fa5b70de3192479d908eaaac820cd35c/FLAG7ccf1b02a [2025-01-10 02:37:16,941 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:37:16,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps6.c [2025-01-10 02:37:16,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7771e70fa/fa5b70de3192479d908eaaac820cd35c/FLAG7ccf1b02a [2025-01-10 02:37:17,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7771e70fa/fa5b70de3192479d908eaaac820cd35c [2025-01-10 02:37:17,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:37:17,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:37:17,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:37:17,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:37:17,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:37:17,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:37:17" (1/1) ... [2025-01-10 02:37:17,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa6ef01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:17, skipping insertion in model container [2025-01-10 02:37:17,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:37:17" (1/1) ... [2025-01-10 02:37:17,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:37:17,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:37:17,432 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:37:17,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:37:17,469 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:37:17,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:17 WrapperNode [2025-01-10 02:37:17,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:37:17,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:37:17,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:37:17,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:37:17,476 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:17" (1/1) ... [2025-01-10 02:37:17,482 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:17" (1/1) ... [2025-01-10 02:37:17,498 INFO L138 Inliner]: procedures = 16, calls = 88, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2025-01-10 02:37:17,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:37:17,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:37:17,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:37:17,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:37:17,509 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:17" (1/1) ... [2025-01-10 02:37:17,509 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:17" (1/1) ... [2025-01-10 02:37:17,511 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:17" (1/1) ... [2025-01-10 02:37:17,530 INFO L175 MemorySlicer]: Split 65 memory accesses to 6 slices as follows [2, 45, 6, 3, 5, 4]. 69 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 0, 6, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 1, 2, 2]. [2025-01-10 02:37:17,530 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:17" (1/1) ... [2025-01-10 02:37:17,530 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:17" (1/1) ... [2025-01-10 02:37:17,534 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:17" (1/1) ... [2025-01-10 02:37:17,539 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:17" (1/1) ... [2025-01-10 02:37:17,540 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:17" (1/1) ... [2025-01-10 02:37:17,541 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:17" (1/1) ... [2025-01-10 02:37:17,542 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:17" (1/1) ... [2025-01-10 02:37:17,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:37:17,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:37:17,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:37:17,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:37:17,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:17" (1/1) ... [2025-01-10 02:37:17,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:37:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:17,577 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:17,580 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:17,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:37:17,598 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_33_0 [2025-01-10 02:37:17,598 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_33_0 [2025-01-10 02:37:17,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:37:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:37:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:37:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:37:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:37:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:37:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:37:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:37:17,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:37:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:37:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:37:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:37:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:37:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:37:17,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:37:17,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:37:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:37:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:37:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:37:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:37:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:37:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:37:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:37:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:37:17,683 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:37:17,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:37:18,227 INFO L? ?]: Removed 499 outVars from TransFormulas that were not future-live. [2025-01-10 02:37:18,227 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:37:18,242 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:37:18,243 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:37:18,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:37:18 BoogieIcfgContainer [2025-01-10 02:37:18,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:37:18,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:37:18,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:37:18,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:37:18,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:37:17" (1/3) ... [2025-01-10 02:37:18,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfae7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:37:18, skipping insertion in model container [2025-01-10 02:37:18,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:37:17" (2/3) ... [2025-01-10 02:37:18,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfae7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:37:18, skipping insertion in model container [2025-01-10 02:37:18,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:37:18" (3/3) ... [2025-01-10 02:37:18,250 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps6.c [2025-01-10 02:37:18,259 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:37:18,260 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps6.c that has 3 procedures, 229 locations, 1 initial locations, 0 loop locations, and 102 error locations. [2025-01-10 02:37:18,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:37:18,318 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;@7f6500e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:37:18,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-01-10 02:37:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 119 states have (on average 1.8823529411764706) internal successors, (224), 222 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:37:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:37:18,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:18,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:37:18,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:18,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash 354931245, now seen corresponding path program 1 times [2025-01-10 02:37:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529169322] [2025-01-10 02:37:18,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:18,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:18,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:37:18,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:37:18,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:18,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:18,642 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:18,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529169322] [2025-01-10 02:37:18,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529169322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:18,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:18,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:18,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710451319] [2025-01-10 02:37:18,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:18,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:18,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:18,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:18,658 INFO L87 Difference]: Start difference. First operand has 229 states, 119 states have (on average 1.8823529411764706) internal successors, (224), 222 states have internal predecessors, (224), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 4 states have (on average 1.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:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:19,005 INFO L93 Difference]: Finished difference Result 632 states and 664 transitions. [2025-01-10 02:37:19,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:19,010 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:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:19,016 INFO L225 Difference]: With dead ends: 632 [2025-01-10 02:37:19,017 INFO L226 Difference]: Without dead ends: 400 [2025-01-10 02:37:19,019 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:19,021 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 322 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:19,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 872 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:37:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-10 02:37:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 271. [2025-01-10 02:37:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.826086956521739) internal successors, (294), 263 states have internal predecessors, (294), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2025-01-10 02:37:19,059 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 6 [2025-01-10 02:37:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:19,059 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2025-01-10 02:37:19,059 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:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2025-01-10 02:37:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 02:37:19,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:19,060 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:19,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:37:19,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_33_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:19,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash 489271929, now seen corresponding path program 1 times [2025-01-10 02:37:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:19,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927746476] [2025-01-10 02:37:19,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:19,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:19,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:37:19,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:37:19,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:19,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:19,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:19,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927746476] [2025-01-10 02:37:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927746476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:19,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:19,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:19,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852930279] [2025-01-10 02:37:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:19,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:19,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:19,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:19,218 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:19,525 INFO L93 Difference]: Finished difference Result 400 states and 405 transitions. [2025-01-10 02:37:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 18 [2025-01-10 02:37:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:19,527 INFO L225 Difference]: With dead ends: 400 [2025-01-10 02:37:19,527 INFO L226 Difference]: Without dead ends: 390 [2025-01-10 02:37:19,527 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:19,528 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 268 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:19,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 837 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:37:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-10 02:37:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 271. [2025-01-10 02:37:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.763975155279503) internal successors, (284), 263 states have internal predecessors, (284), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 295 transitions. [2025-01-10 02:37:19,545 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 295 transitions. Word has length 18 [2025-01-10 02:37:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:19,545 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 295 transitions. [2025-01-10 02:37:19,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 295 transitions. [2025-01-10 02:37:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:37:19,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:19,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:19,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:37:19,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_33_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:19,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:19,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1188697443, now seen corresponding path program 1 times [2025-01-10 02:37:19,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:19,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296870477] [2025-01-10 02:37:19,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:19,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:37:19,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:37:19,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:19,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:19,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [330170537] [2025-01-10 02:37:19,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:19,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:19,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:19,579 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:19,580 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:19,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:37:19,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:37:19,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:19,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:19,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 02:37:19,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:19,671 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:19,784 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:19,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:19,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:19,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296870477] [2025-01-10 02:37:19,785 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:19,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330170537] [2025-01-10 02:37:19,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330170537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:19,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:19,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:19,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653990037] [2025-01-10 02:37:19,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:19,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:19,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:19,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:19,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:19,786 INFO L87 Difference]: Start difference. First operand 271 states and 295 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:20,039 INFO L93 Difference]: Finished difference Result 390 states and 395 transitions. [2025-01-10 02:37:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:20,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 28 [2025-01-10 02:37:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:20,041 INFO L225 Difference]: With dead ends: 390 [2025-01-10 02:37:20,041 INFO L226 Difference]: Without dead ends: 388 [2025-01-10 02:37:20,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:20,042 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 246 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:20,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1016 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-10 02:37:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 271. [2025-01-10 02:37:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.7515527950310559) internal successors, (282), 263 states have internal predecessors, (282), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 293 transitions. [2025-01-10 02:37:20,050 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 293 transitions. Word has length 28 [2025-01-10 02:37:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:20,050 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 293 transitions. [2025-01-10 02:37:20,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 293 transitions. [2025-01-10 02:37:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:37:20,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:20,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:20,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:20,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:20,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_33_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:20,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash -123055419, now seen corresponding path program 1 times [2025-01-10 02:37:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833469515] [2025-01-10 02:37:20,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:20,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:37:20,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:37:20,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:20,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:20,401 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:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:20,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833469515] [2025-01-10 02:37:20,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833469515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:20,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:20,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203917493] [2025-01-10 02:37:20,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:20,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:20,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:20,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:20,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:20,402 INFO L87 Difference]: Start difference. First operand 271 states and 293 transitions. Second operand has 6 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:20,611 INFO L93 Difference]: Finished difference Result 388 states and 393 transitions. [2025-01-10 02:37:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:20,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 30 [2025-01-10 02:37:20,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:20,613 INFO L225 Difference]: With dead ends: 388 [2025-01-10 02:37:20,613 INFO L226 Difference]: Without dead ends: 380 [2025-01-10 02:37:20,613 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:20,613 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 216 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:20,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 848 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-10 02:37:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 271. [2025-01-10 02:37:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.7018633540372672) internal successors, (274), 263 states have internal predecessors, (274), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 285 transitions. [2025-01-10 02:37:20,627 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 285 transitions. Word has length 30 [2025-01-10 02:37:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 285 transitions. [2025-01-10 02:37:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 285 transitions. [2025-01-10 02:37:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 02:37:20,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:20,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:20,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:37:20,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_33_0Err32ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash -940496819, now seen corresponding path program 1 times [2025-01-10 02:37:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487005723] [2025-01-10 02:37:20,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:20,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:20,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:37:20,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:37:20,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:20,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:20,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333558294] [2025-01-10 02:37:20,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:20,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:20,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:20,652 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:20,653 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:20,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:37:20,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:37:20,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:20,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:20,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 02:37:20,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:20,724 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:20,862 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:20,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:20,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:20,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487005723] [2025-01-10 02:37:20,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:20,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333558294] [2025-01-10 02:37:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333558294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:20,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:20,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:37:20,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031265349] [2025-01-10 02:37:20,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:20,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:37:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:20,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:37:20,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:37:20,864 INFO L87 Difference]: Start difference. First operand 271 states and 285 transitions. Second operand has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:37:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:21,115 INFO L93 Difference]: Finished difference Result 380 states and 385 transitions. [2025-01-10 02:37:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:37:21,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-10 02:37:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:21,117 INFO L225 Difference]: With dead ends: 380 [2025-01-10 02:37:21,117 INFO L226 Difference]: Without dead ends: 378 [2025-01-10 02:37:21,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:37:21,118 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 232 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:21,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 867 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:21,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-10 02:37:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 271. [2025-01-10 02:37:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.68944099378882) internal successors, (272), 263 states have internal predecessors, (272), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 283 transitions. [2025-01-10 02:37:21,125 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 283 transitions. Word has length 38 [2025-01-10 02:37:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:21,126 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 283 transitions. [2025-01-10 02:37:21,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:37:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 283 transitions. [2025-01-10 02:37:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 02:37:21,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:21,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:21,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:37:21,327 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:21,327 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_33_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:21,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1874307665, now seen corresponding path program 1 times [2025-01-10 02:37:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:21,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841194376] [2025-01-10 02:37:21,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:21,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:37:21,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:37:21,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:21,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:21,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509345069] [2025-01-10 02:37:21,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:21,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:21,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:21,351 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:21,353 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:21,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:37:21,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:37:21,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:21,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:21,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:37:21,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:21,423 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:21,485 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:21,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841194376] [2025-01-10 02:37:21,486 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509345069] [2025-01-10 02:37:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509345069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:21,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:21,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130716340] [2025-01-10 02:37:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:21,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:21,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:21,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:21,488 INFO L87 Difference]: Start difference. First operand 271 states and 283 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:21,653 INFO L93 Difference]: Finished difference Result 378 states and 383 transitions. [2025-01-10 02:37:21,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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 40 [2025-01-10 02:37:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:21,654 INFO L225 Difference]: With dead ends: 378 [2025-01-10 02:37:21,655 INFO L226 Difference]: Without dead ends: 376 [2025-01-10 02:37:21,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 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:21,655 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 186 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:21,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 872 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-10 02:37:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 271. [2025-01-10 02:37:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.6770186335403727) internal successors, (270), 263 states have internal predecessors, (270), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 281 transitions. [2025-01-10 02:37:21,666 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 281 transitions. Word has length 40 [2025-01-10 02:37:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:21,666 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 281 transitions. [2025-01-10 02:37:21,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 281 transitions. [2025-01-10 02:37:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 02:37:21,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:21,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:21,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:21,867 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:21,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_25_to_33_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:21,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1618365679, now seen corresponding path program 1 times [2025-01-10 02:37:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:21,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729946293] [2025-01-10 02:37:21,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:21,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:37:21,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:37:21,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:21,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:21,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034352957] [2025-01-10 02:37:21,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:21,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:21,883 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:21,885 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:21,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:37:21,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:37:21,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:21,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:21,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:37:21,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:21,958 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:22,160 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:22,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:22,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:22,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729946293] [2025-01-10 02:37:22,161 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034352957] [2025-01-10 02:37:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034352957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:37:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560002892] [2025-01-10 02:37:22,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:22,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:37:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:22,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:37:22,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:37:22,162 INFO L87 Difference]: Start difference. First operand 271 states and 281 transitions. Second operand has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:22,677 INFO L93 Difference]: Finished difference Result 376 states and 381 transitions. [2025-01-10 02:37:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:37:22,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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 42 [2025-01-10 02:37:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:22,678 INFO L225 Difference]: With dead ends: 376 [2025-01-10 02:37:22,678 INFO L226 Difference]: Without dead ends: 375 [2025-01-10 02:37:22,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:37:22,679 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 182 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:22,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 958 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:37:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-10 02:37:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 271. [2025-01-10 02:37:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.670807453416149) internal successors, (269), 263 states have internal predecessors, (269), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 280 transitions. [2025-01-10 02:37:22,685 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 280 transitions. Word has length 42 [2025-01-10 02:37:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:22,685 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 280 transitions. [2025-01-10 02:37:22,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 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:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 280 transitions. [2025-01-10 02:37:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:37:22,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:22,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:22,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:22,889 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,SelfDestructingSolverStorable6 [2025-01-10 02:37:22,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_25_to_33_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:22,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:22,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1370271612, now seen corresponding path program 1 times [2025-01-10 02:37:22,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:22,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184421071] [2025-01-10 02:37:22,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:22,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:22,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:37:22,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:37:22,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:22,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328378909] [2025-01-10 02:37:22,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:22,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:22,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:22,916 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:22,918 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:22,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:37:22,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:37:22,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:22,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:22,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:37:22,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:22,997 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:23,113 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:23,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:23,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:23,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184421071] [2025-01-10 02:37:23,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:23,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328378909] [2025-01-10 02:37:23,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328378909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:23,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:23,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462023392] [2025-01-10 02:37:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:23,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:23,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:23,115 INFO L87 Difference]: Start difference. First operand 271 states and 280 transitions. Second operand has 6 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:23,590 INFO L93 Difference]: Finished difference Result 375 states and 380 transitions. [2025-01-10 02:37:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:23,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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 43 [2025-01-10 02:37:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:23,592 INFO L225 Difference]: With dead ends: 375 [2025-01-10 02:37:23,592 INFO L226 Difference]: Without dead ends: 374 [2025-01-10 02:37:23,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 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:23,592 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 179 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:23,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 823 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:37:23,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-10 02:37:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 271. [2025-01-10 02:37:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.6645962732919255) internal successors, (268), 263 states have internal predecessors, (268), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 279 transitions. [2025-01-10 02:37:23,598 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 279 transitions. Word has length 43 [2025-01-10 02:37:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:23,598 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 279 transitions. [2025-01-10 02:37:23,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 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:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 279 transitions. [2025-01-10 02:37:23,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 02:37:23,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:23,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:23,605 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:23,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:23,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_33_0Err38ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:23,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash -471252877, now seen corresponding path program 1 times [2025-01-10 02:37:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:23,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991453338] [2025-01-10 02:37:23,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:23,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 02:37:23,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:37:23,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:23,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:23,951 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:23,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:23,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991453338] [2025-01-10 02:37:23,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991453338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:23,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:23,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470036143] [2025-01-10 02:37:23,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:23,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:23,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:23,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:23,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:23,952 INFO L87 Difference]: Start difference. First operand 271 states and 279 transitions. Second operand has 6 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:24,023 INFO L93 Difference]: Finished difference Result 380 states and 384 transitions. [2025-01-10 02:37:24,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:24,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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 44 [2025-01-10 02:37:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:24,025 INFO L225 Difference]: With dead ends: 380 [2025-01-10 02:37:24,025 INFO L226 Difference]: Without dead ends: 378 [2025-01-10 02:37:24,025 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:24,025 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 195 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:24,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1058 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-10 02:37:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 271. [2025-01-10 02:37:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.6521739130434783) internal successors, (266), 263 states have internal predecessors, (266), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 277 transitions. [2025-01-10 02:37:24,031 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 277 transitions. Word has length 44 [2025-01-10 02:37:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:24,031 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 277 transitions. [2025-01-10 02:37:24,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 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:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 277 transitions. [2025-01-10 02:37:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 02:37:24,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:24,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:37:24,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_25_to_33_0Err40ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1902445099, now seen corresponding path program 1 times [2025-01-10 02:37:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:24,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906765879] [2025-01-10 02:37:24,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:24,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 02:37:24,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 02:37:24,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:24,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:24,193 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:24,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906765879] [2025-01-10 02:37:24,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906765879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:24,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:24,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301591102] [2025-01-10 02:37:24,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:24,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:24,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:24,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:24,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:24,195 INFO L87 Difference]: Start difference. First operand 271 states and 277 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:24,480 INFO L93 Difference]: Finished difference Result 378 states and 382 transitions. [2025-01-10 02:37:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:24,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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 46 [2025-01-10 02:37:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:24,482 INFO L225 Difference]: With dead ends: 378 [2025-01-10 02:37:24,482 INFO L226 Difference]: Without dead ends: 377 [2025-01-10 02:37:24,482 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:24,482 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 196 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:24,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1013 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:37:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-10 02:37:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 271. [2025-01-10 02:37:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.6459627329192548) internal successors, (265), 263 states have internal predecessors, (265), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 276 transitions. [2025-01-10 02:37:24,488 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 276 transitions. Word has length 46 [2025-01-10 02:37:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:24,488 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 276 transitions. [2025-01-10 02:37:24,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 276 transitions. [2025-01-10 02:37:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:37:24,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:24,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:24,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:37:24,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_33_0Err41ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:24,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1153744192, now seen corresponding path program 1 times [2025-01-10 02:37:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702927463] [2025-01-10 02:37:24,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:24,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:37:24,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:37:24,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:24,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:24,655 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:24,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:24,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702927463] [2025-01-10 02:37:24,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702927463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:24,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:24,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:24,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991667994] [2025-01-10 02:37:24,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:24,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:24,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:24,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:24,656 INFO L87 Difference]: Start difference. First operand 271 states and 276 transitions. Second operand has 6 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:24,915 INFO L93 Difference]: Finished difference Result 377 states and 381 transitions. [2025-01-10 02:37:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:24,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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 47 [2025-01-10 02:37:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:24,917 INFO L225 Difference]: With dead ends: 377 [2025-01-10 02:37:24,917 INFO L226 Difference]: Without dead ends: 376 [2025-01-10 02:37:24,917 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:24,917 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 188 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:24,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 986 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-10 02:37:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 271. [2025-01-10 02:37:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 161 states have (on average 1.639751552795031) internal successors, (264), 263 states have internal predecessors, (264), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 275 transitions. [2025-01-10 02:37:24,924 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 275 transitions. Word has length 47 [2025-01-10 02:37:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:24,925 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 275 transitions. [2025-01-10 02:37:24,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 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:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 275 transitions. [2025-01-10 02:37:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 02:37:24,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:24,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:24,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:37:24,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_25_to_33_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:24,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1776454877, now seen corresponding path program 1 times [2025-01-10 02:37:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:24,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248800260] [2025-01-10 02:37:24,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:24,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:24,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 02:37:24,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 02:37:24,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:24,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:25,111 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:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248800260] [2025-01-10 02:37:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248800260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:25,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:25,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474575180] [2025-01-10 02:37:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:25,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:25,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:25,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:25,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:25,113 INFO L87 Difference]: Start difference. First operand 271 states and 275 transitions. Second operand has 7 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:25,181 INFO L93 Difference]: Finished difference Result 370 states and 374 transitions. [2025-01-10 02:37:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:25,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-01-10 02:37:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:25,183 INFO L225 Difference]: With dead ends: 370 [2025-01-10 02:37:25,183 INFO L226 Difference]: Without dead ends: 369 [2025-01-10 02:37:25,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:25,184 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 149 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:25,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1113 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:37:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-10 02:37:25,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 272. [2025-01-10 02:37:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 264 states have internal predecessors, (265), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 276 transitions. [2025-01-10 02:37:25,192 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 276 transitions. Word has length 55 [2025-01-10 02:37:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:25,192 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 276 transitions. [2025-01-10 02:37:25,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 276 transitions. [2025-01-10 02:37:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 02:37:25,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:25,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:25,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:37:25,193 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_33_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash -764473534, now seen corresponding path program 1 times [2025-01-10 02:37:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084870468] [2025-01-10 02:37:25,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:25,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:37:25,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:37:25,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:25,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:25,417 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:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084870468] [2025-01-10 02:37:25,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084870468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:25,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:25,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:25,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839319474] [2025-01-10 02:37:25,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:25,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:25,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:25,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:25,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:25,418 INFO L87 Difference]: Start difference. First operand 272 states and 276 transitions. Second operand has 7 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:25,489 INFO L93 Difference]: Finished difference Result 272 states and 276 transitions. [2025-01-10 02:37:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:25,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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 56 [2025-01-10 02:37:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:25,492 INFO L225 Difference]: With dead ends: 272 [2025-01-10 02:37:25,492 INFO L226 Difference]: Without dead ends: 271 [2025-01-10 02:37:25,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:25,492 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 275 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:25,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 949 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:37:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-10 02:37:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-01-10 02:37:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 162 states have (on average 1.6296296296296295) internal successors, (264), 263 states have internal predecessors, (264), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 275 transitions. [2025-01-10 02:37:25,498 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 275 transitions. Word has length 56 [2025-01-10 02:37:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:25,498 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 275 transitions. [2025-01-10 02:37:25,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 275 transitions. [2025-01-10 02:37:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 02:37:25,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:25,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:25,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:37:25,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_25_to_33_0Err44ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:25,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2071124351, now seen corresponding path program 1 times [2025-01-10 02:37:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498883208] [2025-01-10 02:37:25,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:25,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 02:37:25,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 02:37:25,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:25,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:25,629 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:25,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:25,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498883208] [2025-01-10 02:37:25,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498883208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:25,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:25,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:25,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789582288] [2025-01-10 02:37:25,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:25,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:25,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:25,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:25,630 INFO L87 Difference]: Start difference. First operand 271 states and 275 transitions. Second operand has 6 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:25,766 INFO L93 Difference]: Finished difference Result 367 states and 372 transitions. [2025-01-10 02:37:25,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:25,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 57 [2025-01-10 02:37:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:25,768 INFO L225 Difference]: With dead ends: 367 [2025-01-10 02:37:25,768 INFO L226 Difference]: Without dead ends: 365 [2025-01-10 02:37:25,768 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:25,768 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 145 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:25,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 895 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-10 02:37:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 274. [2025-01-10 02:37:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 165 states have (on average 1.6181818181818182) internal successors, (267), 266 states have internal predecessors, (267), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-10 02:37:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 278 transitions. [2025-01-10 02:37:25,775 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 278 transitions. Word has length 57 [2025-01-10 02:37:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:25,776 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 278 transitions. [2025-01-10 02:37:25,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 278 transitions. [2025-01-10 02:37:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 02:37:25,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:25,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:25,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:37:25,777 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:25,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash -219508293, now seen corresponding path program 1 times [2025-01-10 02:37:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081968366] [2025-01-10 02:37:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:25,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:25,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 02:37:25,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 02:37:25,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:25,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:25,869 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:25,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:25,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081968366] [2025-01-10 02:37:25,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081968366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:25,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:25,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:37:25,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445236182] [2025-01-10 02:37:25,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:25,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:37:25,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:25,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:37:25,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:37:25,871 INFO L87 Difference]: Start difference. First operand 274 states and 278 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:37:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:26,097 INFO L93 Difference]: Finished difference Result 367 states and 372 transitions. [2025-01-10 02:37:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:37:26,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2025-01-10 02:37:26,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:26,098 INFO L225 Difference]: With dead ends: 367 [2025-01-10 02:37:26,098 INFO L226 Difference]: Without dead ends: 355 [2025-01-10 02:37:26,099 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:26,099 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 193 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:26,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 563 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-10 02:37:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 289. [2025-01-10 02:37:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 179 states have (on average 1.5698324022346368) internal successors, (281), 279 states have internal predecessors, (281), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-01-10 02:37:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 293 transitions. [2025-01-10 02:37:26,108 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 293 transitions. Word has length 58 [2025-01-10 02:37:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:26,109 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 293 transitions. [2025-01-10 02:37:26,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:37:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 293 transitions. [2025-01-10 02:37:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 02:37:26,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:26,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:26,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:37:26,110 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_25_to_33_0Err46ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:26,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1780647457, now seen corresponding path program 1 times [2025-01-10 02:37:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:26,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700401151] [2025-01-10 02:37:26,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:26,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:26,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 02:37:26,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 02:37:26,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:26,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:26,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256181496] [2025-01-10 02:37:26,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:26,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:26,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:26,131 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:26,132 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:26,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 02:37:26,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 02:37:26,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:26,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:26,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 02:37:26,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:26,214 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:26,357 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:26,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700401151] [2025-01-10 02:37:26,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256181496] [2025-01-10 02:37:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256181496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:37:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251908231] [2025-01-10 02:37:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:26,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:37:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:26,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:37:26,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:37:26,359 INFO L87 Difference]: Start difference. First operand 289 states and 293 transitions. Second operand has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:26,654 INFO L93 Difference]: Finished difference Result 374 states and 386 transitions. [2025-01-10 02:37:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:37:26,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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 59 [2025-01-10 02:37:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:26,656 INFO L225 Difference]: With dead ends: 374 [2025-01-10 02:37:26,656 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 02:37:26,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:26,656 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 143 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:26,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1129 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:37:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 02:37:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 325. [2025-01-10 02:37:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 213 states have (on average 1.619718309859155) internal successors, (345), 314 states have internal predecessors, (345), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 359 transitions. [2025-01-10 02:37:26,663 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 359 transitions. Word has length 59 [2025-01-10 02:37:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:26,663 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 359 transitions. [2025-01-10 02:37:26,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 359 transitions. [2025-01-10 02:37:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 02:37:26,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:26,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:26,670 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:26,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 02:37:26,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_33_0Err47ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:26,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash -634503546, now seen corresponding path program 1 times [2025-01-10 02:37:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:26,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131847850] [2025-01-10 02:37:26,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:26,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:26,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:37:26,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:37:26,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:26,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56225484] [2025-01-10 02:37:26,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:26,882 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:26,883 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:26,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 02:37:26,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 02:37:26,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:26,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:26,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 02:37:26,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:26,966 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:27,081 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:27,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:27,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:27,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131847850] [2025-01-10 02:37:27,082 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:27,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56225484] [2025-01-10 02:37:27,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56225484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:27,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:27,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:37:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715294578] [2025-01-10 02:37:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:37:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:27,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:37:27,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:37:27,083 INFO L87 Difference]: Start difference. First operand 325 states and 359 transitions. Second operand has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:27,324 INFO L93 Difference]: Finished difference Result 374 states and 385 transitions. [2025-01-10 02:37:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:37:27,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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 60 [2025-01-10 02:37:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:27,326 INFO L225 Difference]: With dead ends: 374 [2025-01-10 02:37:27,326 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 02:37:27,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:27,327 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 220 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:27,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 886 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 02:37:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 326. [2025-01-10 02:37:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 214 states have (on average 1.6168224299065421) internal successors, (346), 315 states have internal predecessors, (346), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 360 transitions. [2025-01-10 02:37:27,333 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 360 transitions. Word has length 60 [2025-01-10 02:37:27,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:27,333 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 360 transitions. [2025-01-10 02:37:27,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 360 transitions. [2025-01-10 02:37:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-10 02:37:27,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:27,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:27,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:27,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:27,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_25_to_33_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:27,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:27,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1805226691, now seen corresponding path program 1 times [2025-01-10 02:37:27,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:27,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535028373] [2025-01-10 02:37:27,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:27,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 02:37:27,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 02:37:27,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:27,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:27,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734867926] [2025-01-10 02:37:27,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:27,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:27,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:27,560 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:27,562 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:27,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 02:37:27,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 02:37:27,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:27,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:27,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 02:37:27,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:27,649 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:27,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 02:37:27,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 02:37:27,768 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:27,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:27,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:27,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535028373] [2025-01-10 02:37:27,769 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:27,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734867926] [2025-01-10 02:37:27,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734867926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:27,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:27,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 02:37:27,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124475224] [2025-01-10 02:37:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:27,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:37:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:27,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:37:27,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:37:27,770 INFO L87 Difference]: Start difference. First operand 326 states and 360 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 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:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:28,028 INFO L93 Difference]: Finished difference Result 374 states and 384 transitions. [2025-01-10 02:37:28,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:37:28,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 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 61 [2025-01-10 02:37:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:28,030 INFO L225 Difference]: With dead ends: 374 [2025-01-10 02:37:28,030 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 02:37:28,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:37:28,031 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 227 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:28,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 952 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 02:37:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 327. [2025-01-10 02:37:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 215 states have (on average 1.613953488372093) internal successors, (347), 316 states have internal predecessors, (347), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 361 transitions. [2025-01-10 02:37:28,037 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 361 transitions. Word has length 61 [2025-01-10 02:37:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:28,037 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 361 transitions. [2025-01-10 02:37:28,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 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:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 361 transitions. [2025-01-10 02:37:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 02:37:28,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:28,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:28,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:37:28,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:37:28,242 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_25_to_33_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:28,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash 127452712, now seen corresponding path program 1 times [2025-01-10 02:37:28,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:28,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963375723] [2025-01-10 02:37:28,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:28,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:28,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 02:37:28,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 02:37:28,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:28,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:28,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118709896] [2025-01-10 02:37:28,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:28,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:28,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:28,262 INFO L229 MonitoredProcess]: Starting monitored process 10 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:28,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:37:28,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 02:37:28,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 02:37:28,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:28,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:28,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 02:37:28,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:28,354 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:28,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 02:37:28,474 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:28,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963375723] [2025-01-10 02:37:28,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118709896] [2025-01-10 02:37:28,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118709896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 02:37:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215855767] [2025-01-10 02:37:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:28,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:37:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:28,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:37:28,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:37:28,476 INFO L87 Difference]: Start difference. First operand 327 states and 361 transitions. Second operand has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 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:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:28,731 INFO L93 Difference]: Finished difference Result 374 states and 383 transitions. [2025-01-10 02:37:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:37:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 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 62 [2025-01-10 02:37:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:28,733 INFO L225 Difference]: With dead ends: 374 [2025-01-10 02:37:28,733 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 02:37:28,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:37:28,733 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 148 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:28,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1177 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 02:37:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 328. [2025-01-10 02:37:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 216 states have (on average 1.6111111111111112) internal successors, (348), 317 states have internal predecessors, (348), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 362 transitions. [2025-01-10 02:37:28,740 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 362 transitions. Word has length 62 [2025-01-10 02:37:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:28,740 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 362 transitions. [2025-01-10 02:37:28,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 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:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 362 transitions. [2025-01-10 02:37:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 02:37:28,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:28,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:28,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 02:37:28,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:28,945 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_25_to_33_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:28,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:28,946 INFO L85 PathProgramCache]: Analyzing trace with hash -343933083, now seen corresponding path program 1 times [2025-01-10 02:37:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329555229] [2025-01-10 02:37:28,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:28,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:37:28,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:37:28,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:28,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569458015] [2025-01-10 02:37:28,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:28,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:28,966 INFO L229 MonitoredProcess]: Starting monitored process 11 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:28,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:37:29,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:37:29,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:37:29,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:29,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:29,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 02:37:29,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:29,054 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:29,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 02:37:29,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-01-10 02:37:29,204 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:29,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329555229] [2025-01-10 02:37:29,205 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569458015] [2025-01-10 02:37:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569458015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 02:37:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262836586] [2025-01-10 02:37:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:29,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:37:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:29,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:37:29,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:29,205 INFO L87 Difference]: Start difference. First operand 328 states and 362 transitions. Second operand has 10 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 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:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:29,473 INFO L93 Difference]: Finished difference Result 374 states and 382 transitions. [2025-01-10 02:37:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:37:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 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 63 [2025-01-10 02:37:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:29,475 INFO L225 Difference]: With dead ends: 374 [2025-01-10 02:37:29,475 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 02:37:29,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:37:29,475 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 151 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:29,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1084 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 02:37:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 329. [2025-01-10 02:37:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 217 states have (on average 1.608294930875576) internal successors, (349), 318 states have internal predecessors, (349), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 363 transitions. [2025-01-10 02:37:29,481 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 363 transitions. Word has length 63 [2025-01-10 02:37:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:29,481 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 363 transitions. [2025-01-10 02:37:29,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 9 states have internal predecessors, (60), 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:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 363 transitions. [2025-01-10 02:37:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-10 02:37:29,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:29,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:29,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 02:37:29,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:29,686 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_25_to_33_0Err51ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:29,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2071990838, now seen corresponding path program 1 times [2025-01-10 02:37:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921204714] [2025-01-10 02:37:29,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:29,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:29,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:37:29,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:37:29,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:29,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594981609] [2025-01-10 02:37:29,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:29,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:29,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:29,701 INFO L229 MonitoredProcess]: Starting monitored process 12 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:29,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:37:29,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-10 02:37:29,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-10 02:37:29,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:29,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:29,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 02:37:29,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:29,785 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:29,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 02:37:29,915 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:29,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:29,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:29,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921204714] [2025-01-10 02:37:29,916 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:29,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594981609] [2025-01-10 02:37:29,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594981609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:29,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:29,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 02:37:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622692787] [2025-01-10 02:37:29,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:29,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:37:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:29,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:37:29,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:37:29,917 INFO L87 Difference]: Start difference. First operand 329 states and 363 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 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:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:30,106 INFO L93 Difference]: Finished difference Result 374 states and 381 transitions. [2025-01-10 02:37:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:37:30,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 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 64 [2025-01-10 02:37:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:30,107 INFO L225 Difference]: With dead ends: 374 [2025-01-10 02:37:30,107 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 02:37:30,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:37:30,108 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 228 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:30,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1090 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 02:37:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 330. [2025-01-10 02:37:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 218 states have (on average 1.6055045871559632) internal successors, (350), 319 states have internal predecessors, (350), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 364 transitions. [2025-01-10 02:37:30,114 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 364 transitions. Word has length 64 [2025-01-10 02:37:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:30,114 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 364 transitions. [2025-01-10 02:37:30,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 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:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 364 transitions. [2025-01-10 02:37:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 02:37:30,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:30,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:30,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:30,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-10 02:37:30,319 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_25_to_33_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash 192793607, now seen corresponding path program 1 times [2025-01-10 02:37:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753568777] [2025-01-10 02:37:30,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:30,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:37:30,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:37:30,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:30,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105506372] [2025-01-10 02:37:30,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:30,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:30,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:30,335 INFO L229 MonitoredProcess]: Starting monitored process 13 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:30,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 02:37:30,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 02:37:30,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 02:37:30,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:30,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:30,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-10 02:37:30,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:30,424 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:30,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 02:37:30,589 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 43 treesize of output 19 [2025-01-10 02:37:30,608 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:30,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753568777] [2025-01-10 02:37:30,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105506372] [2025-01-10 02:37:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105506372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:30,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:30,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 02:37:30,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561225820] [2025-01-10 02:37:30,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:30,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:37:30,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:30,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:37:30,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:37:30,609 INFO L87 Difference]: Start difference. First operand 330 states and 364 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 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:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:30,829 INFO L93 Difference]: Finished difference Result 374 states and 380 transitions. [2025-01-10 02:37:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:37:30,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 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 65 [2025-01-10 02:37:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:30,831 INFO L225 Difference]: With dead ends: 374 [2025-01-10 02:37:30,831 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 02:37:30,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:37:30,832 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 225 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:30,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 863 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 02:37:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 331. [2025-01-10 02:37:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 219 states have (on average 1.6027397260273972) internal successors, (351), 320 states have internal predecessors, (351), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 365 transitions. [2025-01-10 02:37:30,838 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 365 transitions. Word has length 65 [2025-01-10 02:37:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:30,838 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 365 transitions. [2025-01-10 02:37:30,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 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:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 365 transitions. [2025-01-10 02:37:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 02:37:30,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:30,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:30,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 02:37:31,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:31,039 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_25_to_33_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:31,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1681634668, now seen corresponding path program 1 times [2025-01-10 02:37:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243671450] [2025-01-10 02:37:31,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:31,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 02:37:31,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 02:37:31,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:31,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325250196] [2025-01-10 02:37:31,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:31,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:31,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:31,055 INFO L229 MonitoredProcess]: Starting monitored process 14 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:31,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 02:37:31,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 02:37:31,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 02:37:31,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:31,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:31,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 02:37:31,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:31,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:37:31,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 02:37:31,297 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:31,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243671450] [2025-01-10 02:37:31,298 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325250196] [2025-01-10 02:37:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325250196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 02:37:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675279242] [2025-01-10 02:37:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:31,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:37:31,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:31,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:37:31,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:37:31,299 INFO L87 Difference]: Start difference. First operand 331 states and 365 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 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:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:31,539 INFO L93 Difference]: Finished difference Result 374 states and 379 transitions. [2025-01-10 02:37:31,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:37:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 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 66 [2025-01-10 02:37:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:31,541 INFO L225 Difference]: With dead ends: 374 [2025-01-10 02:37:31,541 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 02:37:31,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:37:31,541 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 144 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:31,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1355 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:31,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 02:37:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 332. [2025-01-10 02:37:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 220 states have (on average 1.6) internal successors, (352), 321 states have internal predecessors, (352), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 366 transitions. [2025-01-10 02:37:31,547 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 366 transitions. Word has length 66 [2025-01-10 02:37:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:31,548 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 366 transitions. [2025-01-10 02:37:31,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 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:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 366 transitions. [2025-01-10 02:37:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 02:37:31,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:31,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:31,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:31,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:31,753 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_25_to_33_0Err54ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:31,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash 591067305, now seen corresponding path program 1 times [2025-01-10 02:37:31,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:31,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490091184] [2025-01-10 02:37:31,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:31,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:31,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:37:31,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:37:31,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:31,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:31,899 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:31,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:31,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490091184] [2025-01-10 02:37:31,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490091184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:31,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:31,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:37:31,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991656297] [2025-01-10 02:37:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:31,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:37:31,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:31,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:37:31,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:37:31,901 INFO L87 Difference]: Start difference. First operand 332 states and 366 transitions. Second operand has 7 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:32,027 INFO L93 Difference]: Finished difference Result 362 states and 370 transitions. [2025-01-10 02:37:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:37:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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 67 [2025-01-10 02:37:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:32,029 INFO L225 Difference]: With dead ends: 362 [2025-01-10 02:37:32,029 INFO L226 Difference]: Without dead ends: 361 [2025-01-10 02:37:32,030 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:32,030 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 134 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:32,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1100 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-01-10 02:37:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 333. [2025-01-10 02:37:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 221 states have (on average 1.5972850678733033) internal successors, (353), 322 states have internal predecessors, (353), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 367 transitions. [2025-01-10 02:37:32,037 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 367 transitions. Word has length 67 [2025-01-10 02:37:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:32,037 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 367 transitions. [2025-01-10 02:37:32,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 367 transitions. [2025-01-10 02:37:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-10 02:37:32,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:32,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:32,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 02:37:32,038 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_25_to_33_0Err55ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1143217422, now seen corresponding path program 1 times [2025-01-10 02:37:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:32,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094001757] [2025-01-10 02:37:32,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:32,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:32,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-10 02:37:32,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-10 02:37:32,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:32,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:32,170 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:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094001757] [2025-01-10 02:37:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094001757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:37:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652025969] [2025-01-10 02:37:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:37:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:32,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:37:32,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:37:32,172 INFO L87 Difference]: Start difference. First operand 333 states and 367 transitions. Second operand has 6 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:32,262 INFO L93 Difference]: Finished difference Result 361 states and 369 transitions. [2025-01-10 02:37:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:37:32,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 68 [2025-01-10 02:37:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:32,264 INFO L225 Difference]: With dead ends: 361 [2025-01-10 02:37:32,264 INFO L226 Difference]: Without dead ends: 360 [2025-01-10 02:37:32,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:37:32,264 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 129 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:32,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1053 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:37:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-10 02:37:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 334. [2025-01-10 02:37:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 222 states have (on average 1.5945945945945945) internal successors, (354), 323 states have internal predecessors, (354), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 368 transitions. [2025-01-10 02:37:32,273 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 368 transitions. Word has length 68 [2025-01-10 02:37:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:32,274 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 368 transitions. [2025-01-10 02:37:32,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 368 transitions. [2025-01-10 02:37:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:37:32,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:32,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:37:32,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 02:37:32,275 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:32,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:32,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1308093703, now seen corresponding path program 1 times [2025-01-10 02:37:32,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:32,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931390477] [2025-01-10 02:37:32,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:32,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:32,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:37:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:37:32,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:32,361 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:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931390477] [2025-01-10 02:37:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931390477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:37:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:37:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416801135] [2025-01-10 02:37:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:32,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:37:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:32,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:37:32,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:37:32,363 INFO L87 Difference]: Start difference. First operand 334 states and 368 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:37:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:32,569 INFO L93 Difference]: Finished difference Result 369 states and 373 transitions. [2025-01-10 02:37:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:37:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2025-01-10 02:37:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:32,570 INFO L225 Difference]: With dead ends: 369 [2025-01-10 02:37:32,570 INFO L226 Difference]: Without dead ends: 359 [2025-01-10 02:37:32,570 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:32,571 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 149 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:32,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 561 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:37:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-10 02:37:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 334. [2025-01-10 02:37:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 222 states have (on average 1.5495495495495495) internal successors, (344), 323 states have internal predecessors, (344), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 358 transitions. [2025-01-10 02:37:32,579 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 358 transitions. Word has length 70 [2025-01-10 02:37:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:32,579 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 358 transitions. [2025-01-10 02:37:32,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:37:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 358 transitions. [2025-01-10 02:37:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 02:37:32,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:32,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 02:37:32,580 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:32,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:32,581 INFO L85 PathProgramCache]: Analyzing trace with hash 739269851, now seen corresponding path program 1 times [2025-01-10 02:37:32,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:32,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863954852] [2025-01-10 02:37:32,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:32,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:32,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:37:32,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:37:32,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:32,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:32,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:32,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863954852] [2025-01-10 02:37:32,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863954852] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:37:32,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598438879] [2025-01-10 02:37:32,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:32,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:32,842 INFO L229 MonitoredProcess]: Starting monitored process 15 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:32,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 02:37:32,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:37:32,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:37:32,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:32,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:32,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:37:32,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:33,027 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:33,054 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:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:33,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:37:33,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598438879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:37:33,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:37:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-01-10 02:37:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374191435] [2025-01-10 02:37:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:37:33,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:37:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:33,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:37:33,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:37:33,066 INFO L87 Difference]: Start difference. First operand 334 states and 358 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:37,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 02:37:41,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-10 02:37:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:41,618 INFO L93 Difference]: Finished difference Result 337 states and 365 transitions. [2025-01-10 02:37:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 02:37:41,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2025-01-10 02:37:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:41,619 INFO L225 Difference]: With dead ends: 337 [2025-01-10 02:37:41,619 INFO L226 Difference]: Without dead ends: 335 [2025-01-10 02:37:41,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:37:41,620 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 405 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:41,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 776 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 580 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-10 02:37:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-10 02:37:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2025-01-10 02:37:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 222 states have (on average 1.5405405405405406) internal successors, (342), 321 states have internal predecessors, (342), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 356 transitions. [2025-01-10 02:37:41,625 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 356 transitions. Word has length 72 [2025-01-10 02:37:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:41,626 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 356 transitions. [2025-01-10 02:37:41,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 356 transitions. [2025-01-10 02:37:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 02:37:41,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:41,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:41,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-10 02:37:41,831 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1442528938, now seen corresponding path program 1 times [2025-01-10 02:37:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790119547] [2025-01-10 02:37:41,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:41,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 02:37:41,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 02:37:41,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:41,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790119547] [2025-01-10 02:37:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790119547] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:37:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541267311] [2025-01-10 02:37:42,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:42,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:42,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:42,087 INFO L229 MonitoredProcess]: Starting monitored process 16 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,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 02:37:42,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 02:37:42,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 02:37:42,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:42,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:42,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 02:37:42,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:42,277 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:42,307 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:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:42,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:37:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541267311] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:37:42,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:37:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-01-10 02:37:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251973516] [2025-01-10 02:37:42,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:37:42,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 02:37:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:42,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 02:37:42,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:37:42,468 INFO L87 Difference]: Start difference. First operand 332 states and 356 transitions. Second operand has 21 states, 19 states have (on average 10.526315789473685) internal successors, (200), 17 states have internal predecessors, (200), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:37:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:43,094 INFO L93 Difference]: Finished difference Result 360 states and 368 transitions. [2025-01-10 02:37:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:37:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 10.526315789473685) internal successors, (200), 17 states have internal predecessors, (200), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 73 [2025-01-10 02:37:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:43,096 INFO L225 Difference]: With dead ends: 360 [2025-01-10 02:37:43,096 INFO L226 Difference]: Without dead ends: 358 [2025-01-10 02:37:43,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2025-01-10 02:37:43,097 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 827 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:43,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1510 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:37:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-10 02:37:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 330. [2025-01-10 02:37:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 222 states have (on average 1.5315315315315314) internal successors, (340), 319 states have internal predecessors, (340), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:37:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 354 transitions. [2025-01-10 02:37:43,103 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 354 transitions. Word has length 73 [2025-01-10 02:37:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:43,103 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 354 transitions. [2025-01-10 02:37:43,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 10.526315789473685) internal successors, (200), 17 states have internal predecessors, (200), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:37:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 354 transitions. [2025-01-10 02:37:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 02:37:43,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:43,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-10 02:37:43,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-10 02:37:43,304 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_25_to_33_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:43,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1768724157, now seen corresponding path program 1 times [2025-01-10 02:37:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:43,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914596502] [2025-01-10 02:37:43,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:43,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:37:43,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:37:43,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:43,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:43,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723383468] [2025-01-10 02:37:43,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:43,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:43,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:43,334 INFO L229 MonitoredProcess]: Starting monitored process 17 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,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 02:37:43,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:37:43,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:37:43,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:43,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:43,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 02:37:43,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:43,436 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,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 02:37:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:43,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:37:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914596502] [2025-01-10 02:37:46,392 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723383468] [2025-01-10 02:37:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723383468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:37:46,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:37:46,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-01-10 02:37:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466163942] [2025-01-10 02:37:46,392 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:37:46,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:37:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:46,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:37:46,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=219, Unknown=1, NotChecked=0, Total=272 [2025-01-10 02:37:46,393 INFO L87 Difference]: Start difference. First operand 330 states and 354 transitions. Second operand has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:46,709 INFO L93 Difference]: Finished difference Result 456 states and 462 transitions. [2025-01-10 02:37:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:37:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2025-01-10 02:37:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:46,710 INFO L225 Difference]: With dead ends: 456 [2025-01-10 02:37:46,710 INFO L226 Difference]: Without dead ends: 455 [2025-01-10 02:37:46,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=103, Invalid=358, Unknown=1, NotChecked=0, Total=462 [2025-01-10 02:37:46,711 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 499 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:46,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1009 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:37:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-01-10 02:37:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 382. [2025-01-10 02:37:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 270 states have (on average 1.5851851851851853) internal successors, (428), 368 states have internal predecessors, (428), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-10 02:37:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 448 transitions. [2025-01-10 02:37:46,718 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 448 transitions. Word has length 74 [2025-01-10 02:37:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:46,719 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 448 transitions. [2025-01-10 02:37:46,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 448 transitions. [2025-01-10 02:37:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 02:37:46,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:46,719 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-01-10 02:37:46,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-10 02:37:46,920 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting func_to_recursive_line_25_to_33_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:46,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1004125940, now seen corresponding path program 1 times [2025-01-10 02:37:46,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:46,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247952993] [2025-01-10 02:37:46,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:46,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 02:37:46,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 02:37:46,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:46,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478741745] [2025-01-10 02:37:46,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:46,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:46,941 INFO L229 MonitoredProcess]: Starting monitored process 18 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:46,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-10 02:37:47,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 02:37:47,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 02:37:47,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:47,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:47,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 02:37:47,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:47,040 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:47,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 02:37:47,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-10 02:37:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:47,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:37:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247952993] [2025-01-10 02:37:47,554 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478741745] [2025-01-10 02:37:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478741745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:37:47,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:37:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-01-10 02:37:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936234597] [2025-01-10 02:37:47,554 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:37:47,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:37:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:47,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:37:47,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:37:47,555 INFO L87 Difference]: Start difference. First operand 382 states and 448 transitions. Second operand has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:48,123 INFO L93 Difference]: Finished difference Result 455 states and 461 transitions. [2025-01-10 02:37:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:37:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-01-10 02:37:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:48,124 INFO L225 Difference]: With dead ends: 455 [2025-01-10 02:37:48,124 INFO L226 Difference]: Without dead ends: 454 [2025-01-10 02:37:48,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:37:48,125 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 363 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:48,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1505 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:37:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-01-10 02:37:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 382. [2025-01-10 02:37:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 270 states have (on average 1.5814814814814815) internal successors, (427), 368 states have internal predecessors, (427), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-10 02:37:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 447 transitions. [2025-01-10 02:37:48,133 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 447 transitions. Word has length 75 [2025-01-10 02:37:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:48,133 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 447 transitions. [2025-01-10 02:37:48,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 447 transitions. [2025-01-10 02:37:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-10 02:37:48,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:48,134 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-01-10 02:37:48,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:48,334 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting func_to_recursive_line_25_to_33_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:48,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1063133025, now seen corresponding path program 1 times [2025-01-10 02:37:48,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314365477] [2025-01-10 02:37:48,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:48,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:48,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 02:37:48,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 02:37:48,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:48,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548603197] [2025-01-10 02:37:48,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:48,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:48,353 INFO L229 MonitoredProcess]: Starting monitored process 19 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:48,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-10 02:37:48,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-10 02:37:48,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-10 02:37:48,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:48,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:48,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-10 02:37:48,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:48,455 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:48,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 02:37:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:48,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:37:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:37:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314365477] [2025-01-10 02:37:48,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:37:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548603197] [2025-01-10 02:37:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548603197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:37:48,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:37:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-10 02:37:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314554449] [2025-01-10 02:37:48,875 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:37:48,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:37:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:37:48,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:37:48,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:37:48,877 INFO L87 Difference]: Start difference. First operand 382 states and 447 transitions. Second operand has 12 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:37:49,365 INFO L93 Difference]: Finished difference Result 454 states and 460 transitions. [2025-01-10 02:37:49,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 02:37:49,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2025-01-10 02:37:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:37:49,367 INFO L225 Difference]: With dead ends: 454 [2025-01-10 02:37:49,367 INFO L226 Difference]: Without dead ends: 453 [2025-01-10 02:37:49,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2025-01-10 02:37:49,367 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 358 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:37:49,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1740 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:37:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-01-10 02:37:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 382. [2025-01-10 02:37:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 270 states have (on average 1.5777777777777777) internal successors, (426), 368 states have internal predecessors, (426), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-10 02:37:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 446 transitions. [2025-01-10 02:37:49,375 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 446 transitions. Word has length 76 [2025-01-10 02:37:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:37:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 446 transitions. [2025-01-10 02:37:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:37:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 446 transitions. [2025-01-10 02:37:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-10 02:37:49,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:37:49,375 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-10 02:37:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:49,576 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting func_to_recursive_line_25_to_33_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:37:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:37:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1402614638, now seen corresponding path program 1 times [2025-01-10 02:37:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:37:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258431814] [2025-01-10 02:37:49,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:37:49,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 02:37:49,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 02:37:49,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:49,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:37:49,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443857355] [2025-01-10 02:37:49,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:37:49,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:37:49,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:37:49,597 INFO L229 MonitoredProcess]: Starting monitored process 20 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,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-10 02:37:49,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-10 02:37:49,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-10 02:37:49,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:37:49,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:37:49,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 02:37:49,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:37:49,702 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:49,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 02:37:49,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-10 02:37:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:37:49,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:38:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258431814] [2025-01-10 02:38:06,358 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:38:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443857355] [2025-01-10 02:38:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443857355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:38:06,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:38:06,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-10 02:38:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195068615] [2025-01-10 02:38:06,358 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:38:06,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:38:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:06,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:38:06,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=307, Unknown=4, NotChecked=0, Total=380 [2025-01-10 02:38:06,359 INFO L87 Difference]: Start difference. First operand 382 states and 446 transitions. Second operand has 12 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:38:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:06,951 INFO L93 Difference]: Finished difference Result 453 states and 459 transitions. [2025-01-10 02:38:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 02:38:06,952 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2025-01-10 02:38:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:06,953 INFO L225 Difference]: With dead ends: 453 [2025-01-10 02:38:06,953 INFO L226 Difference]: Without dead ends: 452 [2025-01-10 02:38:06,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=140, Invalid=506, Unknown=4, NotChecked=0, Total=650 [2025-01-10 02:38:06,954 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 545 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:06,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1191 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:38:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-01-10 02:38:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 382. [2025-01-10 02:38:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 270 states have (on average 1.5740740740740742) internal successors, (425), 368 states have internal predecessors, (425), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-10 02:38:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 445 transitions. [2025-01-10 02:38:06,961 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 445 transitions. Word has length 77 [2025-01-10 02:38:06,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:06,961 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 445 transitions. [2025-01-10 02:38:06,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:38:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 445 transitions. [2025-01-10 02:38:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-10 02:38:06,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:06,962 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 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:38:06,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-01-10 02:38:07,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:38:07,166 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting func_to_recursive_line_25_to_33_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:38:07,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:07,166 INFO L85 PathProgramCache]: Analyzing trace with hash 531380865, now seen corresponding path program 1 times [2025-01-10 02:38:07,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:07,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568552236] [2025-01-10 02:38:07,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:07,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:07,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 02:38:07,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 02:38:07,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:07,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:38:07,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485354325] [2025-01-10 02:38:07,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:07,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:38:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:38:07,188 INFO L229 MonitoredProcess]: Starting monitored process 21 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:38:07,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-01-10 02:38:07,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 02:38:07,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 02:38:07,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:07,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:07,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 02:38:07,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:38:07,303 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:38:07,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-10 02:38:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:07,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:38:07,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:38:07,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568552236] [2025-01-10 02:38:07,893 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:38:07,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485354325] [2025-01-10 02:38:07,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485354325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:38:07,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:38:07,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-01-10 02:38:07,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024561411] [2025-01-10 02:38:07,894 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:38:07,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 02:38:07,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:38:07,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 02:38:07,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:38:07,894 INFO L87 Difference]: Start difference. First operand 382 states and 445 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:38:08,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:38:08,209 INFO L93 Difference]: Finished difference Result 452 states and 458 transitions. [2025-01-10 02:38:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:38:08,210 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2025-01-10 02:38:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:38:08,211 INFO L225 Difference]: With dead ends: 452 [2025-01-10 02:38:08,211 INFO L226 Difference]: Without dead ends: 451 [2025-01-10 02:38:08,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2025-01-10 02:38:08,211 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 597 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:38:08,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1017 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:38:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-01-10 02:38:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 382. [2025-01-10 02:38:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 270 states have (on average 1.5703703703703704) internal successors, (424), 368 states have internal predecessors, (424), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-10 02:38:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 444 transitions. [2025-01-10 02:38:08,218 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 444 transitions. Word has length 78 [2025-01-10 02:38:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:38:08,219 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 444 transitions. [2025-01-10 02:38:08,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:38:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 444 transitions. [2025-01-10 02:38:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-10 02:38:08,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:38:08,219 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 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:38:08,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-01-10 02:38:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:38:08,420 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 100 more)] === [2025-01-10 02:38:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:38:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash -707062320, now seen corresponding path program 1 times [2025-01-10 02:38:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:38:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192094486] [2025-01-10 02:38:08,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:38:08,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 02:38:08,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 02:38:08,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:08,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:38:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787134982] [2025-01-10 02:38:08,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:38:08,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:38:08,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:38:08,439 INFO L229 MonitoredProcess]: Starting monitored process 22 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:38:08,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-01-10 02:38:08,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-10 02:38:08,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-10 02:38:08,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:38:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:38:08,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 02:38:08,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:38:08,539 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:38:08,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-01-10 02:38:08,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-01-10 02:38:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:08,698 INFO L312 TraceCheckSpWp]: Computing backward predicates...