./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 48c9605d 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-?-48c9605-m [2025-02-08 10:03:09,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:03:09,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:03:09,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:03:09,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:03:09,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:03:09,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:03:09,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:03:09,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:03:09,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:03:09,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:03:09,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:03:09,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:03:09,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:03:09,380 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:03:09,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:03:09,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:03:09,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:03:09,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:03:09,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:03:09,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:03:09,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:03:09,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:03:09,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:03:09,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:03:09,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:03:09,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:03:09,383 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-02-08 10:03:09,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:03:09,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:03:09,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:03:09,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:03:09,611 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:03:09,611 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-02-08 10:03:10,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7a44b3b0/e14ee70842184943b4bb906b8f98201b/FLAG214b367a2 [2025-02-08 10:03:10,950 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:03:10,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-02-08 10:03:10,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7a44b3b0/e14ee70842184943b4bb906b8f98201b/FLAG214b367a2 [2025-02-08 10:03:11,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7a44b3b0/e14ee70842184943b4bb906b8f98201b [2025-02-08 10:03:11,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:03:11,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:03:11,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:03:11,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:03:11,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:03:11,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9177fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11, skipping insertion in model container [2025-02-08 10:03:11,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:03:11,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:03:11,462 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:03:11,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:03:11,491 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:03:11,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11 WrapperNode [2025-02-08 10:03:11,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:03:11,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:03:11,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:03:11,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:03:11,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,516 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-02-08 10:03:11,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:03:11,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:03:11,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:03:11,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:03:11,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,545 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-02-08 10:03:11,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:03:11,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:03:11,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:03:11,559 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:03:11,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (1/1) ... [2025-02-08 10:03:11,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:03:11,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:11,585 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-02-08 10:03:11,587 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-02-08 10:03:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:03:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-02-08 10:03:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-02-08 10:03:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-02-08 10:03:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2025-02-08 10:03:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:03:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:03:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:03:11,677 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:03:11,678 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:03:11,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset; [2025-02-08 10:03:11,870 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-08 10:03:11,870 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:03:11,881 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:03:11,881 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:03:11,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:03:11 BoogieIcfgContainer [2025-02-08 10:03:11,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:03:11,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:03:11,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:03:11,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:03:11,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:03:11" (1/3) ... [2025-02-08 10:03:11,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f07cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:03:11, skipping insertion in model container [2025-02-08 10:03:11,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:11" (2/3) ... [2025-02-08 10:03:11,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f07cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:03:11, skipping insertion in model container [2025-02-08 10:03:11,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:03:11" (3/3) ... [2025-02-08 10:03:11,889 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2025-02-08 10:03:11,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:03:11,903 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_4.c that has 5 procedures, 55 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-02-08 10:03:11,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:03:11,959 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;@3ec27766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:03:11,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 10:03:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 46 states have internal predecessors, (50), 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-02-08 10:03:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 10:03:11,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:11,968 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:11,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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-02-08 10:03:11,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1280059673, now seen corresponding path program 1 times [2025-02-08 10:03:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:11,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010806736] [2025-02-08 10:03:11,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:12,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 10:03:12,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 10:03:12,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:12,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:12,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:12,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010806736] [2025-02-08 10:03:12,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010806736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:12,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812269655] [2025-02-08 10:03:12,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:12,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:12,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:12,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:12,388 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 46 states have internal predecessors, (50), 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, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-02-08 10:03:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:12,505 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-02-08 10:03:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:12,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 11 [2025-02-08 10:03:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:12,511 INFO L225 Difference]: With dead ends: 70 [2025-02-08 10:03:12,511 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 10:03:12,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:03:12,516 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:12,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 10:03:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 10:03:12,543 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), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 10:03:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-02-08 10:03:12,549 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 11 [2025-02-08 10:03:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:12,549 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-02-08 10:03:12,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-02-08 10:03:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-02-08 10:03:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 10:03:12,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:12,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:12,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:03:12,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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-02-08 10:03:12,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:12,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1495313164, now seen corresponding path program 1 times [2025-02-08 10:03:12,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:12,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698177121] [2025-02-08 10:03:12,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:12,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 10:03:12,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 10:03:12,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:12,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698177121] [2025-02-08 10:03:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698177121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:12,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869384441] [2025-02-08 10:03:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:12,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:12,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:12,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:12,730 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-02-08 10:03:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:12,795 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2025-02-08 10:03:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:12,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2025-02-08 10:03:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:12,798 INFO L225 Difference]: With dead ends: 96 [2025-02-08 10:03:12,798 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 10:03:12,798 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-02-08 10:03:12,799 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 5 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 203 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-02-08 10:03:12,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 203 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 10:03:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-02-08 10:03:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 40 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 10:03:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-02-08 10:03:12,804 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 14 [2025-02-08 10:03:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:12,804 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-02-08 10:03:12,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-02-08 10:03:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-02-08 10:03:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 10:03:12,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:12,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:12,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:03:12,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-02-08 10:03:12,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash 889932176, now seen corresponding path program 1 times [2025-02-08 10:03:12,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:12,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034721222] [2025-02-08 10:03:12,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:12,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 10:03:12,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 10:03:12,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:12,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:12,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034721222] [2025-02-08 10:03:12,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034721222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:12,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:12,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:03:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869653057] [2025-02-08 10:03:12,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:12,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 10:03:12,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:12,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 10:03:12,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 10:03:12,898 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-02-08 10:03:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:12,925 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-02-08 10:03:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 10:03:12,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 15 [2025-02-08 10:03:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:12,926 INFO L225 Difference]: With dead ends: 51 [2025-02-08 10:03:12,926 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 10:03:12,928 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-02-08 10:03:12,928 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 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-02-08 10:03:12,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 10:03:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-08 10:03:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 10:03:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-02-08 10:03:12,941 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 15 [2025-02-08 10:03:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:12,942 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-02-08 10:03:12,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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-02-08 10:03:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-02-08 10:03:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 10:03:12,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:12,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:12,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 10:03:12,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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-02-08 10:03:12,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1495913532, now seen corresponding path program 1 times [2025-02-08 10:03:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889834340] [2025-02-08 10:03:12,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:12,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 10:03:12,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 10:03:12,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:12,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:13,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:13,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889834340] [2025-02-08 10:03:13,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889834340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:13,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:13,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:03:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239274386] [2025-02-08 10:03:13,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:13,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:13,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:13,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:13,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:13,075 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 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-02-08 10:03:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:13,166 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2025-02-08 10:03:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:13,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 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 14 [2025-02-08 10:03:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:13,168 INFO L225 Difference]: With dead ends: 108 [2025-02-08 10:03:13,168 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 10:03:13,168 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-02-08 10:03:13,169 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:13,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 107 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 10:03:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2025-02-08 10:03:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 40 states have internal predecessors, (42), 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-02-08 10:03:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-02-08 10:03:13,176 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 14 [2025-02-08 10:03:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:13,176 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-02-08 10:03:13,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 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-02-08 10:03:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-02-08 10:03:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 10:03:13,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:13,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:13,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:03:13,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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-02-08 10:03:13,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1002487890, now seen corresponding path program 1 times [2025-02-08 10:03:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:13,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931799876] [2025-02-08 10:03:13,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:13,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 10:03:13,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 10:03:13,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:13,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931799876] [2025-02-08 10:03:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931799876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:03:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474170958] [2025-02-08 10:03:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:03:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:13,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:03:13,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:03:13,329 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-02-08 10:03:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:13,387 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-02-08 10:03:13,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:03:13,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 19 [2025-02-08 10:03:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:13,388 INFO L225 Difference]: With dead ends: 58 [2025-02-08 10:03:13,389 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 10:03:13,389 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-02-08 10:03:13,389 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:13,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 10:03:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-02-08 10:03:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.28125) internal successors, (41), 39 states have internal predecessors, (41), 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-02-08 10:03:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-02-08 10:03:13,396 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 19 [2025-02-08 10:03:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:13,397 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-02-08 10:03:13,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-02-08 10:03:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-02-08 10:03:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 10:03:13,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:13,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:13,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 10:03:13,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-02-08 10:03:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 256513989, now seen corresponding path program 1 times [2025-02-08 10:03:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:13,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033389435] [2025-02-08 10:03:13,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:13,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 10:03:13,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 10:03:13,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:13,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 10:03:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033389435] [2025-02-08 10:03:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033389435] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732290921] [2025-02-08 10:03:13,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:13,538 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-02-08 10:03:13,540 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-02-08 10:03:13,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 10:03:13,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 10:03:13,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:13,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:13,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 10:03:13,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:13,652 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-02-08 10:03:13,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 10:03:13,841 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-02-08 10:03:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:13,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:03:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:03:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732290921] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:13,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 10:03:13,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 9] total 19 [2025-02-08 10:03:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023583840] [2025-02-08 10:03:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:13,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:13,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:13,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:13,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-02-08 10:03:13,944 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:03:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:14,001 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-02-08 10:03:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:03:14,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-02-08 10:03:14,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:14,002 INFO L225 Difference]: With dead ends: 53 [2025-02-08 10:03:14,002 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 10:03:14,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2025-02-08 10:03:14,003 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:14,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 10:03:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-02-08 10:03:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.25) internal successors, (40), 38 states have internal predecessors, (40), 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-02-08 10:03:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-02-08 10:03:14,008 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2025-02-08 10:03:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:14,008 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-02-08 10:03:14,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:03:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-02-08 10:03:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 10:03:14,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:14,009 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] [2025-02-08 10:03:14,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 10:03:14,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:14,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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-02-08 10:03:14,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash -181584147, now seen corresponding path program 1 times [2025-02-08 10:03:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113639131] [2025-02-08 10:03:14,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:14,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 10:03:14,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 10:03:14,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:14,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:03:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:14,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113639131] [2025-02-08 10:03:14,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113639131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:14,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:14,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:14,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964454275] [2025-02-08 10:03:14,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:14,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:14,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:14,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:14,318 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-02-08 10:03:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:14,372 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2025-02-08 10:03:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:14,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 24 [2025-02-08 10:03:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:14,373 INFO L225 Difference]: With dead ends: 61 [2025-02-08 10:03:14,373 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 10:03:14,373 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-02-08 10:03:14,374 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 189 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-02-08 10:03:14,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 189 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 10:03:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 10:03:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-08 10:03:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-02-08 10:03:14,378 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 24 [2025-02-08 10:03:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:14,379 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-02-08 10:03:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-02-08 10:03:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-02-08 10:03:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 10:03:14,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:14,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 10:03:14,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 10:03:14,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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-02-08 10:03:14,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash -638000940, now seen corresponding path program 1 times [2025-02-08 10:03:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:14,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089430635] [2025-02-08 10:03:14,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:14,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:03:14,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:03:14,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:14,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 10:03:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089430635] [2025-02-08 10:03:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089430635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590642195] [2025-02-08 10:03:14,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:14,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:14,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:14,506 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-02-08 10:03:14,507 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-02-08 10:03:14,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 10:03:14,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 10:03:14,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:14,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:14,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 10:03:14,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:14,627 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-02-08 10:03:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 10:03:14,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:03:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590642195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:03:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-02-08 10:03:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273842555] [2025-02-08 10:03:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:14,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:14,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:14,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 10:03:14,642 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:03:18,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 10:03:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:18,719 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-02-08 10:03:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:03:18,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-02-08 10:03:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:18,720 INFO L225 Difference]: With dead ends: 57 [2025-02-08 10:03:18,720 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 10:03:18,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:03:18,721 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:18,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 10:03:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 10:03:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-02-08 10:03:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 37 states have internal predecessors, (39), 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-02-08 10:03:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-02-08 10:03:18,733 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 23 [2025-02-08 10:03:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:18,733 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-02-08 10:03:18,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 10:03:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-02-08 10:03:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 10:03:18,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:18,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:18,744 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-02-08 10:03:18,938 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-02-08 10:03:18,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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-02-08 10:03:18,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash -571603887, now seen corresponding path program 1 times [2025-02-08 10:03:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:18,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735789633] [2025-02-08 10:03:18,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:18,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 10:03:18,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 10:03:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 10:03:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735789633] [2025-02-08 10:03:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735789633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:19,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 10:03:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086619783] [2025-02-08 10:03:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:19,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:19,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:19,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:19,059 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 10:03:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:19,115 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2025-02-08 10:03:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 10:03:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-02-08 10:03:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:19,116 INFO L225 Difference]: With dead ends: 64 [2025-02-08 10:03:19,116 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 10:03:19,116 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-02-08 10:03:19,116 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:19,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 177 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 10:03:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-02-08 10:03:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 43 states have internal predecessors, (46), 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-02-08 10:03:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-02-08 10:03:19,124 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 34 [2025-02-08 10:03:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:19,124 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-02-08 10:03:19,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 10:03:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-02-08 10:03:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 10:03:19,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:19,125 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] [2025-02-08 10:03:19,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 10:03:19,125 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-02-08 10:03:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1774763897, now seen corresponding path program 1 times [2025-02-08 10:03:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:19,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485657841] [2025-02-08 10:03:19,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:19,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:19,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 10:03:19,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 10:03:19,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:19,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 10:03:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485657841] [2025-02-08 10:03:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485657841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849214284] [2025-02-08 10:03:19,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:19,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:19,443 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-02-08 10:03:19,444 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-02-08 10:03:19,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 10:03:19,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 10:03:19,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:19,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:19,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 10:03:19,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:19,526 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-02-08 10:03:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 10:03:19,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:03:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 10:03:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849214284] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:03:20,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:03:20,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2025-02-08 10:03:20,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524144982] [2025-02-08 10:03:20,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:03:20,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 10:03:20,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:20,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 10:03:20,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-02-08 10:03:20,157 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 21 states have internal predecessors, (49), 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-02-08 10:03:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:20,583 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2025-02-08 10:03:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:03:20,584 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 21 states have internal predecessors, (49), 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 42 [2025-02-08 10:03:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:20,585 INFO L225 Difference]: With dead ends: 124 [2025-02-08 10:03:20,585 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 10:03:20,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2025-02-08 10:03:20,586 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:20,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 368 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:03:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 10:03:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-02-08 10:03:20,599 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), 9 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-08 10:03:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-02-08 10:03:20,600 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 42 [2025-02-08 10:03:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:20,601 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-02-08 10:03:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 21 states have internal predecessors, (49), 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-02-08 10:03:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-02-08 10:03:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 10:03:20,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:20,604 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] [2025-02-08 10:03:20,769 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-02-08 10:03:20,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:20,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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-02-08 10:03:20,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:20,805 INFO L85 PathProgramCache]: Analyzing trace with hash 215855239, now seen corresponding path program 2 times [2025-02-08 10:03:20,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:20,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380228557] [2025-02-08 10:03:20,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:03:20,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:21,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-02-08 10:03:21,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 10:03:21,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 10:03:21,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-02-08 10:03:21,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380228557] [2025-02-08 10:03:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380228557] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365379813] [2025-02-08 10:03:21,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:03:21,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:21,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:21,426 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-02-08 10:03:21,427 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-02-08 10:03:21,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-02-08 10:03:21,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 10:03:21,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 10:03:21,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:21,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-08 10:03:21,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:21,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:03:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-08 10:03:21,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:03:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 3 proven. 124 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-08 10:03:23,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365379813] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:03:23,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:03:23,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 21] total 45 [2025-02-08 10:03:23,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089170028] [2025-02-08 10:03:23,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:03:23,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-08 10:03:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:23,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-08 10:03:23,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1746, Unknown=0, NotChecked=0, Total=1980 [2025-02-08 10:03:23,192 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 45 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 35 states have internal predecessors, (70), 14 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-08 10:03:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:24,053 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2025-02-08 10:03:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 10:03:24,054 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 35 states have internal predecessors, (70), 14 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) Word has length 70 [2025-02-08 10:03:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:24,055 INFO L225 Difference]: With dead ends: 134 [2025-02-08 10:03:24,055 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 10:03:24,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=479, Invalid=3943, Unknown=0, NotChecked=0, Total=4422 [2025-02-08 10:03:24,057 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 96 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:24,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 495 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 10:03:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 10:03:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-02-08 10:03:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 10 states have call successors, (10), 7 states have call predecessors, (10), 10 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-08 10:03:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-02-08 10:03:24,071 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 70 [2025-02-08 10:03:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-02-08 10:03:24,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 35 states have internal predecessors, (70), 14 states have call successors, (21), 12 states have call predecessors, (21), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-08 10:03:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-02-08 10:03:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 10:03:24,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:24,075 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:24,083 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-02-08 10:03:24,276 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,SelfDestructingSolverStorable10 [2025-02-08 10:03:24,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-02-08 10:03:24,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1815423504, now seen corresponding path program 1 times [2025-02-08 10:03:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:24,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181832508] [2025-02-08 10:03:24,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:24,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 10:03:24,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 10:03:24,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:24,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-08 10:03:24,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181832508] [2025-02-08 10:03:24,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181832508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:24,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:24,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 10:03:24,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162897561] [2025-02-08 10:03:24,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:24,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:03:24,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:24,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:03:24,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:03:24,367 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:03:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:24,494 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-02-08 10:03:24,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:03:24,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 85 [2025-02-08 10:03:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:24,498 INFO L225 Difference]: With dead ends: 65 [2025-02-08 10:03:24,498 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 10:03:24,498 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-02-08 10:03:24,499 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 138 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:24,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 138 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 10:03:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2025-02-08 10:03:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 42 states have internal predecessors, (45), 9 states have call successors, (9), 7 states have call predecessors, (9), 10 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2025-02-08 10:03:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-02-08 10:03:24,510 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 85 [2025-02-08 10:03:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:24,511 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-02-08 10:03:24,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 10:03:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-02-08 10:03:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 10:03:24,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:24,512 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 10:03:24,512 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-02-08 10:03:24,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2053019666, now seen corresponding path program 1 times [2025-02-08 10:03:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:24,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839620974] [2025-02-08 10:03:24,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:24,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 10:03:24,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 10:03:24,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:24,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-02-08 10:03:24,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:24,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839620974] [2025-02-08 10:03:24,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839620974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:24,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383662292] [2025-02-08 10:03:24,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:24,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:24,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:24,874 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-02-08 10:03:24,879 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-02-08 10:03:24,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 10:03:25,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 10:03:25,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:25,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:25,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 10:03:25,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:25,017 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-02-08 10:03:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 158 proven. 24 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-08 10:03:25,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 10:03:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 215 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-08 10:03:27,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383662292] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 10:03:27,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 10:03:27,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 26] total 45 [2025-02-08 10:03:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019946002] [2025-02-08 10:03:27,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 10:03:27,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-08 10:03:27,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:27,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-08 10:03:27,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1677, Unknown=0, NotChecked=0, Total=1980 [2025-02-08 10:03:27,057 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (23), 9 states have call predecessors, (23), 14 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2025-02-08 10:03:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:27,810 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2025-02-08 10:03:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 10:03:27,811 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (23), 9 states have call predecessors, (23), 14 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) Word has length 107 [2025-02-08 10:03:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:27,811 INFO L225 Difference]: With dead ends: 126 [2025-02-08 10:03:27,811 INFO L226 Difference]: Without dead ends: 68 [2025-02-08 10:03:27,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=548, Invalid=2992, Unknown=0, NotChecked=0, Total=3540 [2025-02-08 10:03:27,812 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:27,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 372 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 10:03:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-08 10:03:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-02-08 10:03:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 7 states have call predecessors, (9), 12 states have return successors, (16), 12 states have call predecessors, (16), 7 states have call successors, (16) [2025-02-08 10:03:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-02-08 10:03:27,824 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 107 [2025-02-08 10:03:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:27,825 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-02-08 10:03:27,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 38 states have internal predecessors, (83), 12 states have call successors, (23), 9 states have call predecessors, (23), 14 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2025-02-08 10:03:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-02-08 10:03:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-08 10:03:27,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:27,826 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 20, 20, 20, 20, 20, 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] [2025-02-08 10:03:27,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 10:03:28,032 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,SelfDestructingSolverStorable12 [2025-02-08 10:03:28,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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-02-08 10:03:28,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash -801497532, now seen corresponding path program 2 times [2025-02-08 10:03:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:28,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112395473] [2025-02-08 10:03:28,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:03:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:28,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 217 statements into 2 equivalence classes. [2025-02-08 10:03:28,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 10:03:28,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 10:03:28,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2025-02-08 10:03:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112395473] [2025-02-08 10:03:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112395473] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397969968] [2025-02-08 10:03:28,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 10:03:28,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:28,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:28,774 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-02-08 10:03:28,776 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-02-08 10:03:28,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 217 statements into 2 equivalence classes. [2025-02-08 10:03:28,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 10:03:28,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 10:03:28,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:29,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 10:03:29,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:29,072 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-02-08 10:03:29,413 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-02-08 10:03:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-02-08 10:03:29,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:03:29,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397969968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:29,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:03:29,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2025-02-08 10:03:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296126576] [2025-02-08 10:03:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:29,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:03:29,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:29,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:03:29,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 10:03:29,427 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 10:03:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:29,520 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2025-02-08 10:03:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:03:29,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 217 [2025-02-08 10:03:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:29,521 INFO L225 Difference]: With dead ends: 67 [2025-02-08 10:03:29,521 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 10:03:29,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-02-08 10:03:29,522 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:29,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 123 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 10:03:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2025-02-08 10:03:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 9 states have call successors, (9), 7 states have call predecessors, (9), 12 states have return successors, (16), 12 states have call predecessors, (16), 7 states have call successors, (16) [2025-02-08 10:03:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-02-08 10:03:29,533 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 217 [2025-02-08 10:03:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:29,533 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-02-08 10:03:29,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 10:03:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-02-08 10:03:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-08 10:03:29,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:29,536 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 20, 20, 20, 20, 20, 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] [2025-02-08 10:03:29,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 10:03:29,737 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,SelfDestructingSolverStorable13 [2025-02-08 10:03:29,737 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-02-08 10:03:29,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash 923380266, now seen corresponding path program 1 times [2025-02-08 10:03:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390160370] [2025-02-08 10:03:29,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:29,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 10:03:29,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 10:03:29,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:29,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2025-02-08 10:03:30,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:30,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390160370] [2025-02-08 10:03:30,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390160370] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 10:03:30,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399272092] [2025-02-08 10:03:30,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:30,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:30,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:30,176 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-02-08 10:03:30,178 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-02-08 10:03:30,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 10:03:30,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 10:03:30,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:30,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:30,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 10:03:30,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:30,566 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-02-08 10:03:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2025-02-08 10:03:30,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:03:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399272092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:30,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 10:03:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-08 10:03:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271815655] [2025-02-08 10:03:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:30,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 10:03:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:30,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 10:03:30,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-08 10:03:30,580 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 10:03:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:30,641 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2025-02-08 10:03:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 10:03:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 218 [2025-02-08 10:03:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:30,642 INFO L225 Difference]: With dead ends: 69 [2025-02-08 10:03:30,642 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 10:03:30,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 214 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-02-08 10:03:30,644 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:30,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 10:03:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 10:03:30,645 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-02-08 10:03:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 10:03:30,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2025-02-08 10:03:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:30,645 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 10:03:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 10:03:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 10:03:30,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 10:03:30,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-08 10:03:30,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-08 10:03:30,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-08 10:03:30,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-08 10:03:30,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-08 10:03:30,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_22_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-08 10:03:30,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-08 10:03:30,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-08 10:03:30,659 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-02-08 10:03:30,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:30,854 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:30,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 10:03:52,222 WARN L286 SmtUtils]: Spent 20.11s on a formula simplification. DAG size of input: 64 DAG size of output: 49 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-02-08 10:03:52,237 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 10:03:52,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 10:03:52 BoogieIcfgContainer [2025-02-08 10:03:52,241 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 10:03:52,241 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 10:03:52,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 10:03:52,241 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 10:03:52,242 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:03:11" (3/4) ... [2025-02-08 10:03:52,243 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 10:03:52,248 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_24_to_25_0 [2025-02-08 10:03:52,248 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_23_to_24_0 [2025-02-08 10:03:52,249 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_22_to_23_0 [2025-02-08 10:03:52,249 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_25_to_25_0 [2025-02-08 10:03:52,252 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 10:03:52,253 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 10:03:52,253 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 10:03:52,253 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 10:03:52,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 10:03:52,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 10:03:52,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 10:03:52,307 INFO L158 Benchmark]: Toolchain (without parser) took 40979.52ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 105.7MB in the beginning and 371.7MB in the end (delta: -266.0MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2025-02-08 10:03:52,307 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:03:52,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.83ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 95.5MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:03:52,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.25ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:03:52,308 INFO L158 Benchmark]: Boogie Preprocessor took 40.24ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:03:52,308 INFO L158 Benchmark]: IcfgBuilder took 322.95ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 75.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 10:03:52,308 INFO L158 Benchmark]: TraceAbstraction took 40357.20ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.6MB in the beginning and 379.9MB in the end (delta: -305.3MB). Peak memory consumption was 215.3MB. Max. memory is 16.1GB. [2025-02-08 10:03:52,308 INFO L158 Benchmark]: Witness Printer took 65.34ms. Allocated memory is still 419.4MB. Free memory was 379.9MB in the beginning and 371.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:03:52,309 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.83ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 95.5MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.25ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.24ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 322.95ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 75.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40357.20ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.6MB in the beginning and 379.9MB in the end (delta: -305.3MB). Peak memory consumption was 215.3MB. Max. memory is 16.1GB. * Witness Printer took 65.34ms. Allocated memory is still 419.4MB. Free memory was 379.9MB in the beginning and 371.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 55 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 15, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 3197 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2615 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2211 IncrementalHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 582 mSDtfsCounter, 2211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1106 GetRequests, 849 SyntacticMatches, 5 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=11, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 51 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1614 NumberOfCodeBlocks, 1614 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1829 ConstructedInterpolants, 212 QuantifiedInterpolants, 6577 SizeOfPredicates, 46 NumberOfNonLiveVariables, 3589 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 8403/8886 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 10:03:52,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE