./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.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_loop-simple/recursified_nested_4.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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:34:40,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:34:40,580 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:34:40,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:34:40,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:34:40,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:34:40,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:34:40,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:34:40,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:34:40,603 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:34:40,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:34:40,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:34:40,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:34:40,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:34:40,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:34:40,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:34:40,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:34:40,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:40,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:40,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:34:40,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:34:40,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:34:40,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:34:40,607 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2025-01-10 02:34:40,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:34:40,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:34:40,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:34:40,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:34:40,863 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:34:40,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-01-10 02:34:42,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8597af2a2/9ec3fd26a7b44643b8faa877d3fe037e/FLAG54268d0f9 [2025-01-10 02:34:42,427 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:34:42,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-01-10 02:34:42,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8597af2a2/9ec3fd26a7b44643b8faa877d3fe037e/FLAG54268d0f9 [2025-01-10 02:34:42,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8597af2a2/9ec3fd26a7b44643b8faa877d3fe037e [2025-01-10 02:34:42,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:34:42,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:34:42,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:34:42,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:34:42,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:34:42,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6350a18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42, skipping insertion in model container [2025-01-10 02:34:42,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:34:42,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:34:42,605 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:34:42,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:34:42,631 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:34:42,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42 WrapperNode [2025-01-10 02:34:42,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:34:42,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:34:42,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:34:42,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:34:42,637 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:34:42" (1/1) ... [2025-01-10 02:34:42,646 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:34:42" (1/1) ... [2025-01-10 02:34:42,657 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-01-10 02:34:42,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:34:42,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:34:42,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:34:42,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:34:42,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,677 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2025-01-10 02:34:42,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:34:42,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:34:42,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:34:42,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:34:42,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (1/1) ... [2025-01-10 02:34:42,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:42,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:42,722 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:34:42,724 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:34:42,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:34:42,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:34:42,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:34:42,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:34:42,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:34:42,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:34:42,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-01-10 02:34:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-01-10 02:34:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-01-10 02:34:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-01-10 02:34:42,741 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2025-01-10 02:34:42,741 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2025-01-10 02:34:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:34:42,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:34:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:34:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:34:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:34:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:34:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:34:42,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:34:42,805 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:34:42,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:34:42,962 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-10 02:34:42,963 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:34:42,969 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:34:42,970 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:34:42,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:42 BoogieIcfgContainer [2025-01-10 02:34:42,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:34:42,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:34:42,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:34:42,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:34:42,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:34:42" (1/3) ... [2025-01-10 02:34:42,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcf8fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:42, skipping insertion in model container [2025-01-10 02:34:42,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:42" (2/3) ... [2025-01-10 02:34:42,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bcf8fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:42, skipping insertion in model container [2025-01-10 02:34:42,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:42" (3/3) ... [2025-01-10 02:34:42,977 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2025-01-10 02:34:42,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:34:42,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_4.c that has 5 procedures, 57 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-01-10 02:34:43,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:34:43,047 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;@6b3e5f46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:34:43,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 02:34:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 48 states have internal predecessors, (52), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:34:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:34:43,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:43,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:43,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1116531470, now seen corresponding path program 1 times [2025-01-10 02:34:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702420097] [2025-01-10 02:34:43,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:43,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:34:43,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:34:43,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:43,486 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:34:43,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:43,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702420097] [2025-01-10 02:34:43,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702420097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:43,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:43,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:43,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229722291] [2025-01-10 02:34:43,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:43,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:43,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:43,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:43,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:43,509 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 48 states have internal predecessors, (52), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:34:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:43,733 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2025-01-10 02:34:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2025-01-10 02:34:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:43,739 INFO L225 Difference]: With dead ends: 114 [2025-01-10 02:34:43,739 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 02:34:43,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:34:43,743 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:43,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 143 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 02:34:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-10 02:34:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.44) internal successors, (36), 36 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-10 02:34:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-01-10 02:34:43,784 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 12 [2025-01-10 02:34:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:43,784 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-01-10 02:34:43,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:34:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-01-10 02:34:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:34:43,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:43,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:43,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:34:43,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:43,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1877172776, now seen corresponding path program 1 times [2025-01-10 02:34:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958229907] [2025-01-10 02:34:43,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:43,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:34:43,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:34:43,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:43,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:43,982 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:34:43,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:43,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958229907] [2025-01-10 02:34:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958229907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:43,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:43,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494671181] [2025-01-10 02:34:43,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:43,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:43,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:43,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:43,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:43,984 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,029 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2025-01-10 02:34:44,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:44,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 02:34:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,030 INFO L225 Difference]: With dead ends: 92 [2025-01-10 02:34:44,030 INFO L226 Difference]: Without dead ends: 50 [2025-01-10 02:34:44,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:34:44,033 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:44,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 208 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-10 02:34:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-01-10 02:34:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 38 states have internal predecessors, (39), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-10 02:34:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-01-10 02:34:44,038 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2025-01-10 02:34:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,038 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-01-10 02:34:44,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-01-10 02:34:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:34:44,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:44,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:34:44,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:44,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1937186170, now seen corresponding path program 1 times [2025-01-10 02:34:44,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576669467] [2025-01-10 02:34:44,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:34:44,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:34:44,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,088 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:34:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576669467] [2025-01-10 02:34:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576669467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:44,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:44,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:34:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168564434] [2025-01-10 02:34:44,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:44,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:34:44,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:44,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:34:44,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:34:44,089 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,123 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2025-01-10 02:34:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:34:44,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-10 02:34:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,124 INFO L225 Difference]: With dead ends: 48 [2025-01-10 02:34:44,124 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 02:34:44,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:34:44,125 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:44,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 02:34:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-10 02:34:44,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 37 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-10 02:34:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-01-10 02:34:44,129 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 16 [2025-01-10 02:34:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,129 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-01-10 02:34:44,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-01-10 02:34:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:34:44,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:44,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:34:44,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:44,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1871222199, now seen corresponding path program 1 times [2025-01-10 02:34:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13356980] [2025-01-10 02:34:44,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:34:44,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:34:44,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,212 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:34:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13356980] [2025-01-10 02:34:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13356980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:44,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:44,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45295734] [2025-01-10 02:34:44,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:44,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:44,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:44,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:44,214 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 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:34:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,257 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2025-01-10 02:34:44,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:44,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 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 15 [2025-01-10 02:34:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,260 INFO L225 Difference]: With dead ends: 57 [2025-01-10 02:34:44,260 INFO L226 Difference]: Without dead ends: 53 [2025-01-10 02:34:44,260 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:34:44,261 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:44,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 204 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-10 02:34:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-10 02:34:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 41 states have internal predecessors, (43), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-10 02:34:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-01-10 02:34:44,265 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 15 [2025-01-10 02:34:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,265 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-01-10 02:34:44,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 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:34:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-01-10 02:34:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:34:44,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:44,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:34:44,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:44,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2140617374, now seen corresponding path program 1 times [2025-01-10 02:34:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666017747] [2025-01-10 02:34:44,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:34:44,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:34:44,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,413 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:34:44,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666017747] [2025-01-10 02:34:44,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666017747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:44,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:44,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:44,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788193810] [2025-01-10 02:34:44,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:44,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:44,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:44,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:44,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:34:44,414 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,478 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-01-10 02:34:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:44,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 02:34:44,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,480 INFO L225 Difference]: With dead ends: 59 [2025-01-10 02:34:44,480 INFO L226 Difference]: Without dead ends: 58 [2025-01-10 02:34:44,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 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:34:44,480 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:44,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 200 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-10 02:34:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2025-01-10 02:34:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 40 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-10 02:34:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-01-10 02:34:44,485 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 20 [2025-01-10 02:34:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,486 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-01-10 02:34:44,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-01-10 02:34:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:34:44,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,486 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] [2025-01-10 02:34:44,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:34:44,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:44,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,487 INFO L85 PathProgramCache]: Analyzing trace with hash 863656053, now seen corresponding path program 1 times [2025-01-10 02:34:44,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084412609] [2025-01-10 02:34:44,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:34:44,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:34:44,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:34:44,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084412609] [2025-01-10 02:34:44,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084412609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:44,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:44,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518002578] [2025-01-10 02:34:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:44,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:44,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:44,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:44,599 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:44,652 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2025-01-10 02:34:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:44,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-01-10 02:34:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:44,653 INFO L225 Difference]: With dead ends: 72 [2025-01-10 02:34:44,653 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 02:34:44,653 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:34:44,653 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:44,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 191 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 02:34:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2025-01-10 02:34:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 46 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-10 02:34:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2025-01-10 02:34:44,659 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 25 [2025-01-10 02:34:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:44,659 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2025-01-10 02:34:44,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:34:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2025-01-10 02:34:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:34:44,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:44,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:44,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:34:44,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:44,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash -520615220, now seen corresponding path program 1 times [2025-01-10 02:34:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:44,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106742097] [2025-01-10 02:34:44,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:44,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:34:44,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:34:44,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:34:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106742097] [2025-01-10 02:34:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106742097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521824877] [2025-01-10 02:34:44,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:44,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:44,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:44,875 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:34:44,879 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:34:44,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:34:44,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:34:44,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:44,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:44,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-10 02:34:44,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:45,016 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:34:45,059 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:34:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:34:45,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:45,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521824877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:45,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2025-01-10 02:34:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037914252] [2025-01-10 02:34:45,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:45,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:45,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:45,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:45,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:34:45,110 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:34:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:45,204 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2025-01-10 02:34:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:45,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-10 02:34:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:45,205 INFO L225 Difference]: With dead ends: 121 [2025-01-10 02:34:45,205 INFO L226 Difference]: Without dead ends: 61 [2025-01-10 02:34:45,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:34:45,206 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:45,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 135 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-10 02:34:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-10 02:34:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 45 states have internal predecessors, (48), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-01-10 02:34:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2025-01-10 02:34:45,212 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 26 [2025-01-10 02:34:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:45,212 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2025-01-10 02:34:45,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:34:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2025-01-10 02:34:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:34:45,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:45,213 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:45,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:34:45,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:45,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -782233795, now seen corresponding path program 1 times [2025-01-10 02:34:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214328353] [2025-01-10 02:34:45,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:45,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:34:45,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:34:45,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:45,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:34:45,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:45,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214328353] [2025-01-10 02:34:45,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214328353] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373145047] [2025-01-10 02:34:45,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:45,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:45,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:45,771 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:34:45,772 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:34:45,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:34:45,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:34:45,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:45,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:45,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 02:34:45,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:45,866 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:34:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 02:34:46,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 02:34:46,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373145047] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:46,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:46,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2025-01-10 02:34:46,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338247856] [2025-01-10 02:34:46,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:46,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 02:34:46,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:46,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 02:34:46,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:34:46,369 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 21 states have internal predecessors, (50), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-10 02:34:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:46,568 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2025-01-10 02:34:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 02:34:46,569 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 21 states have internal predecessors, (50), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2025-01-10 02:34:46,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:46,569 INFO L225 Difference]: With dead ends: 123 [2025-01-10 02:34:46,569 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 02:34:46,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2025-01-10 02:34:46,570 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 28 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:46,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 278 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 02:34:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-10 02:34:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 47 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2025-01-10 02:34:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-01-10 02:34:46,584 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 43 [2025-01-10 02:34:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:46,584 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-01-10 02:34:46,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 21 states have internal predecessors, (50), 7 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-10 02:34:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-01-10 02:34:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 02:34:46,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:46,585 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:46,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:34:46,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:46,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:46,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 459659657, now seen corresponding path program 2 times [2025-01-10 02:34:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502364384] [2025-01-10 02:34:46,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:46,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-10 02:34:46,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:34:46,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:46,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-10 02:34:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:47,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502364384] [2025-01-10 02:34:47,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502364384] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:47,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351184538] [2025-01-10 02:34:47,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:47,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:47,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:47,243 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:34:47,244 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:34:47,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-10 02:34:47,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:34:47,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:34:47,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:47,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:34:47,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:47,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:34:47,590 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:34:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-10 02:34:47,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:47,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351184538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:47,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:47,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-01-10 02:34:47,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516824280] [2025-01-10 02:34:47,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:47,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:47,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:47,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:47,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:34:47,614 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:34:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:47,793 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2025-01-10 02:34:47,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:47,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2025-01-10 02:34:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:47,794 INFO L225 Difference]: With dead ends: 68 [2025-01-10 02:34:47,794 INFO L226 Difference]: Without dead ends: 67 [2025-01-10 02:34:47,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:34:47,795 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 46 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:47,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 134 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-10 02:34:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2025-01-10 02:34:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 46 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2025-01-10 02:34:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-01-10 02:34:47,802 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 71 [2025-01-10 02:34:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:47,802 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-01-10 02:34:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:34:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-01-10 02:34:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 02:34:47,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:47,803 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:47,810 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:34:48,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:48,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:48,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1364547518, now seen corresponding path program 1 times [2025-01-10 02:34:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:48,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751368296] [2025-01-10 02:34:48,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:48,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:34:48,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:34:48,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:48,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-01-10 02:34:48,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:48,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751368296] [2025-01-10 02:34:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751368296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:48,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968687687] [2025-01-10 02:34:48,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:48,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:48,266 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:34:48,267 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:34:48,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:34:48,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:34:48,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:48,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:48,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:34:48,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:48,477 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:34:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-10 02:34:48,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968687687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:34:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-10 02:34:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658291135] [2025-01-10 02:34:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:48,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:48,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:48,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:34:48,492 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:34:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:48,545 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-01-10 02:34:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:34:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2025-01-10 02:34:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:48,548 INFO L225 Difference]: With dead ends: 64 [2025-01-10 02:34:48,549 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 02:34:48,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:34:48,550 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:48,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 140 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 02:34:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-01-10 02:34:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 42 states have internal predecessors, (45), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-10 02:34:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-01-10 02:34:48,565 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 72 [2025-01-10 02:34:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:48,565 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-01-10 02:34:48,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 02:34:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-01-10 02:34:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-10 02:34:48,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:48,566 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2025-01-10 02:34:48,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:34:48,766 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,SelfDestructingSolverStorable9 [2025-01-10 02:34:48,767 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash 573386362, now seen corresponding path program 1 times [2025-01-10 02:34:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:48,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317764563] [2025-01-10 02:34:48,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:48,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 02:34:48,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 02:34:48,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:48,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 02:34:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317764563] [2025-01-10 02:34:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317764563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834378301] [2025-01-10 02:34:49,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:49,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:49,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:49,012 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:34:49,013 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:34:49,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-10 02:34:49,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-10 02:34:49,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:49,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:49,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 02:34:49,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:49,107 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:34:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-10 02:34:49,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 02:34:49,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834378301] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:49,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:49,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-01-10 02:34:49,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888399238] [2025-01-10 02:34:49,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:49,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 02:34:49,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:49,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 02:34:49,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-01-10 02:34:49,644 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 27 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (14), 8 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-10 02:34:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:50,094 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2025-01-10 02:34:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 02:34:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (14), 8 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2025-01-10 02:34:50,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:50,095 INFO L225 Difference]: With dead ends: 119 [2025-01-10 02:34:50,095 INFO L226 Difference]: Without dead ends: 63 [2025-01-10 02:34:50,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1313, Unknown=0, NotChecked=0, Total=1560 [2025-01-10 02:34:50,097 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:50,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 138 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:34:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-10 02:34:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-10 02:34:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.175) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 7 states have call predecessors, (9), 10 states have return successors, (14), 11 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-10 02:34:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2025-01-10 02:34:50,104 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 59 [2025-01-10 02:34:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:50,104 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2025-01-10 02:34:50,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (14), 8 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-10 02:34:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2025-01-10 02:34:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-10 02:34:50,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:50,105 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:50,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:34:50,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 02:34:50,310 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:50,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash 868077772, now seen corresponding path program 1 times [2025-01-10 02:34:50,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:50,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-01-10 02:34:50,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:50,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:50,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-10 02:34:50,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-10 02:34:50,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-01-10 02:34:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-01-10 02:34:50,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776024483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144909266] [2025-01-10 02:34:50,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:50,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:50,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:50,980 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:34:50,985 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:34:51,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-10 02:34:51,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-10 02:34:51,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:51,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:51,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-10 02:34:51,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:51,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:34:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 289 proven. 15 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-01-10 02:34:51,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:34:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 7 proven. 327 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-01-10 02:34:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144909266] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:34:53,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:34:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 21] total 38 [2025-01-10 02:34:53,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260492694] [2025-01-10 02:34:53,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:34:53,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-10 02:34:53,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:53,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-10 02:34:53,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2025-01-10 02:34:53,326 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 38 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 11 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-10 02:34:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:53,811 INFO L93 Difference]: Finished difference Result 125 states and 153 transitions. [2025-01-10 02:34:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 02:34:53,812 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 11 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) Word has length 162 [2025-01-10 02:34:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:53,813 INFO L225 Difference]: With dead ends: 125 [2025-01-10 02:34:53,813 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 02:34:53,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=359, Invalid=2191, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 02:34:53,814 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:53,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 496 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:34:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 02:34:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-10 02:34:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.146341463414634) internal successors, (47), 45 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) [2025-01-10 02:34:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-01-10 02:34:53,826 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 162 [2025-01-10 02:34:53,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:53,827 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-01-10 02:34:53,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 11 states have call successors, (23), 9 states have call predecessors, (23), 10 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2025-01-10 02:34:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-01-10 02:34:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 02:34:53,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:53,831 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:53,838 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:34:54,031 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,SelfDestructingSolverStorable11 [2025-01-10 02:34:54,032 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:54,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash -728849238, now seen corresponding path program 1 times [2025-01-10 02:34:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:54,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403270324] [2025-01-10 02:34:54,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:54,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:54,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 02:34:54,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 02:34:54,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2025-01-10 02:34:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:54,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403270324] [2025-01-10 02:34:54,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403270324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:54,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:34:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654766119] [2025-01-10 02:34:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:54,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:34:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:54,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:34:54,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:34:54,184 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:34:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:54,233 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-01-10 02:34:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:34:54,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 191 [2025-01-10 02:34:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:54,235 INFO L225 Difference]: With dead ends: 65 [2025-01-10 02:34:54,235 INFO L226 Difference]: Without dead ends: 64 [2025-01-10 02:34:54,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:34:54,236 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:54,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-10 02:34:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-10 02:34:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (17), 12 states have call predecessors, (17), 8 states have call successors, (17) [2025-01-10 02:34:54,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-01-10 02:34:54,245 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 191 [2025-01-10 02:34:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:54,245 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-01-10 02:34:54,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 02:34:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-01-10 02:34:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-10 02:34:54,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:54,249 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:54,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:34:54,249 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:54,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 426934436, now seen corresponding path program 2 times [2025-01-10 02:34:54,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:54,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658162173] [2025-01-10 02:34:54,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:34:54,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:54,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-01-10 02:34:54,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 202 statements. [2025-01-10 02:34:54,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:34:54,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2025-01-10 02:34:54,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:54,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658162173] [2025-01-10 02:34:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658162173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:54,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:54,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815904798] [2025-01-10 02:34:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:54,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:54,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:54,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:34:54,344 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:34:54,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:54,425 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-01-10 02:34:54,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:34:54,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 202 [2025-01-10 02:34:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:54,426 INFO L225 Difference]: With dead ends: 73 [2025-01-10 02:34:54,426 INFO L226 Difference]: Without dead ends: 72 [2025-01-10 02:34:54,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:34:54,427 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:54,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 209 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-10 02:34:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-01-10 02:34:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 47 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 11 states have return successors, (18), 13 states have call predecessors, (18), 9 states have call successors, (18) [2025-01-10 02:34:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-01-10 02:34:54,437 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 202 [2025-01-10 02:34:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-01-10 02:34:54,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:34:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-01-10 02:34:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-10 02:34:54,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:54,439 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:34:54,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash 350065697, now seen corresponding path program 1 times [2025-01-10 02:34:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033904978] [2025-01-10 02:34:54,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:54,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-10 02:34:54,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-10 02:34:54,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:54,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2025-01-10 02:34:54,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:54,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033904978] [2025-01-10 02:34:54,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033904978] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:54,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320362289] [2025-01-10 02:34:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:54,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:54,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:54,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:54,685 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:34:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:54,721 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-01-10 02:34:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:54,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 203 [2025-01-10 02:34:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:54,722 INFO L225 Difference]: With dead ends: 71 [2025-01-10 02:34:54,722 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 02:34:54,722 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:34:54,723 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:54,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 184 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:34:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 02:34:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-10 02:34:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 11 states have call successors, (11), 8 states have call predecessors, (11), 11 states have return successors, (18), 13 states have call predecessors, (18), 9 states have call successors, (18) [2025-01-10 02:34:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2025-01-10 02:34:54,731 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 203 [2025-01-10 02:34:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:54,732 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2025-01-10 02:34:54,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:34:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2025-01-10 02:34:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-01-10 02:34:54,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:54,735 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 32, 32, 32, 32, 32, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:54,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:34:54,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:34:54,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1293418681, now seen corresponding path program 1 times [2025-01-10 02:34:54,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:54,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496407943] [2025-01-10 02:34:54,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:54,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:54,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-01-10 02:34:54,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-01-10 02:34:54,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:54,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5107 backedges. 23 proven. 1131 refuted. 0 times theorem prover too weak. 3953 trivial. 0 not checked. [2025-01-10 02:34:56,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496407943] [2025-01-10 02:34:56,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496407943] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:34:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765124186] [2025-01-10 02:34:56,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:56,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:56,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:56,606 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:34:56,612 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:34:56,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-01-10 02:34:56,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-01-10 02:34:56,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:56,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:56,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-10 02:34:56,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:56,906 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:34:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5107 backedges. 2734 proven. 24 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2025-01-10 02:34:57,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:35:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5107 backedges. 327 proven. 855 refuted. 0 times theorem prover too weak. 3925 trivial. 0 not checked. [2025-01-10 02:35:00,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765124186] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:35:00,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:35:00,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 26] total 44 [2025-01-10 02:35:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764577075] [2025-01-10 02:35:00,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:35:00,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-10 02:35:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:00,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-10 02:35:00,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1534, Unknown=0, NotChecked=0, Total=1892 [2025-01-10 02:35:00,670 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 44 states, 35 states have (on average 2.742857142857143) internal successors, (96), 38 states have internal predecessors, (96), 11 states have call successors, (26), 8 states have call predecessors, (26), 13 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-01-10 02:35:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:01,037 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2025-01-10 02:35:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 02:35:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 35 states have (on average 2.742857142857143) internal successors, (96), 38 states have internal predecessors, (96), 11 states have call successors, (26), 8 states have call predecessors, (26), 13 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) Word has length 403 [2025-01-10 02:35:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:01,038 INFO L225 Difference]: With dead ends: 138 [2025-01-10 02:35:01,038 INFO L226 Difference]: Without dead ends: 74 [2025-01-10 02:35:01,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 785 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=501, Invalid=2049, Unknown=0, NotChecked=0, Total=2550 [2025-01-10 02:35:01,040 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:01,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 579 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:35:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-10 02:35:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-10 02:35:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 11 states have call successors, (11), 8 states have call predecessors, (11), 13 states have return successors, (20), 15 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-10 02:35:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-01-10 02:35:01,047 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 403 [2025-01-10 02:35:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-01-10 02:35:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 35 states have (on average 2.742857142857143) internal successors, (96), 38 states have internal predecessors, (96), 11 states have call successors, (26), 8 states have call predecessors, (26), 13 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-01-10 02:35:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-01-10 02:35:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-01-10 02:35:01,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:01,051 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 48, 48, 48, 48, 48, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:01,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:35:01,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:01,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:35:01,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1452742073, now seen corresponding path program 2 times [2025-01-10 02:35:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:01,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107581084] [2025-01-10 02:35:01,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:35:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:01,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 515 statements into 2 equivalence classes. [2025-01-10 02:35:01,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 515 of 515 statements. [2025-01-10 02:35:01,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:35:01,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10043 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10038 trivial. 0 not checked. [2025-01-10 02:35:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107581084] [2025-01-10 02:35:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107581084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:35:02,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420659936] [2025-01-10 02:35:02,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:35:02,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:02,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:02,059 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:35:02,065 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:35:02,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 515 statements into 2 equivalence classes. [2025-01-10 02:35:02,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 515 of 515 statements. [2025-01-10 02:35:02,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:35:02,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:02,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 02:35:02,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:02,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:35:02,881 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:35:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10043 backedges. 5149 proven. 0 refuted. 0 times theorem prover too weak. 4894 trivial. 0 not checked. [2025-01-10 02:35:02,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:02,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420659936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:02,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:35:02,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-01-10 02:35:02,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201702864] [2025-01-10 02:35:02,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:02,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:35:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:02,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:35:02,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:35:02,901 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:35:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:02,976 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2025-01-10 02:35:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:35:02,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 515 [2025-01-10 02:35:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:02,979 INFO L225 Difference]: With dead ends: 75 [2025-01-10 02:35:02,979 INFO L226 Difference]: Without dead ends: 74 [2025-01-10 02:35:02,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:35:02,979 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:02,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:35:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-10 02:35:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-01-10 02:35:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 states have internal predecessors, (52), 11 states have call successors, (11), 8 states have call predecessors, (11), 13 states have return successors, (20), 15 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-10 02:35:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-01-10 02:35:02,986 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 515 [2025-01-10 02:35:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:02,987 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-01-10 02:35:02,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:35:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-01-10 02:35:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-01-10 02:35:02,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:02,989 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 48, 48, 48, 48, 48, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:02,998 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:35:03,189 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,SelfDestructingSolverStorable16 [2025-01-10 02:35:03,190 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 02:35:03,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:03,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2085331234, now seen corresponding path program 1 times [2025-01-10 02:35:03,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:03,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981797375] [2025-01-10 02:35:03,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:03,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:03,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-01-10 02:35:03,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-01-10 02:35:03,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:03,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10044 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10038 trivial. 0 not checked. [2025-01-10 02:35:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981797375] [2025-01-10 02:35:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981797375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:35:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351989771] [2025-01-10 02:35:03,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:03,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:03,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:03,930 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:35:03,931 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:35:04,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-01-10 02:35:04,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-01-10 02:35:04,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:04,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:04,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:35:04,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:04,604 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:35:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10044 backedges. 5149 proven. 0 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2025-01-10 02:35:04,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351989771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:04,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:35:04,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-10 02:35:04,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225309620] [2025-01-10 02:35:04,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:04,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:35:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:04,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:35:04,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:35:04,618 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:35:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:04,671 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-01-10 02:35:04,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:35:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 516 [2025-01-10 02:35:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:04,673 INFO L225 Difference]: With dead ends: 73 [2025-01-10 02:35:04,673 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:35:04,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:35:04,674 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:04,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:35:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:35:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:35:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:35:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:35:04,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 516 [2025-01-10 02:35:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:04,675 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:35:04,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 02:35:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:35:04,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:35:04,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 02:35:04,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 02:35:04,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 02:35:04,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 02:35:04,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 02:35:04,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 02:35:04,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 02:35:04,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 02:35:04,689 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:35:04,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:35:04,884 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:04,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:35:21,296 WARN L286 SmtUtils]: Spent 16.08s on a formula simplification. DAG size of input: 73 DAG size of output: 56 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-01-10 02:35:45,468 WARN L286 SmtUtils]: Spent 24.11s on a formula simplification. DAG size of input: 73 DAG size of output: 51 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)