./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:31:24,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:31:24,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:31:24,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:31:24,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:31:24,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:31:24,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:31:24,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:31:24,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:31:24,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:31:24,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:31:24,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:31:24,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:31:24,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:31:24,623 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:31:24,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:31:24,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:31:24,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:31:24,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:31:24,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:31:24,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:31:24,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:31:24,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:31:24,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:31:24,626 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2025-03-04 11:31:24,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:31:24,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:31:24,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:31:24,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:31:24,829 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:31:24,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-04 11:31:25,897 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458749193/1a9741c52f4a41e4840ee96a303da282/FLAGdb25ba49c [2025-03-04 11:31:26,091 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:31:26,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-03-04 11:31:26,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458749193/1a9741c52f4a41e4840ee96a303da282/FLAGdb25ba49c [2025-03-04 11:31:26,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458749193/1a9741c52f4a41e4840ee96a303da282 [2025-03-04 11:31:26,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:31:26,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:31:26,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:31:26,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:31:26,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:31:26,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c913def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26, skipping insertion in model container [2025-03-04 11:31:26,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:31:26,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:31:26,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:31:26,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:31:26,594 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:31:26,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26 WrapperNode [2025-03-04 11:31:26,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:31:26,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:31:26,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:31:26,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:31:26,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,620 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-03-04 11:31:26,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:31:26,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:31:26,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:31:26,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:31:26,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,650 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2025-03-04 11:31:26,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:31:26,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:31:26,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:31:26,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:31:26,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (1/1) ... [2025-03-04 11:31:26,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:31:26,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:26,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:31:26,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:31:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:31:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:31:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:31:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:31:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:31:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:31:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:31:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:31:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:31:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:31:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:31:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:31:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:31:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:31:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-03-04 11:31:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-03-04 11:31:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-03-04 11:31:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-03-04 11:31:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-03-04 11:31:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-03-04 11:31:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:31:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:31:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:31:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:31:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:31:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:31:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:31:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:31:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-03-04 11:31:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-03-04 11:31:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-03-04 11:31:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-03-04 11:31:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:31:26,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:31:26,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:31:26,982 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: 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;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset; [2025-03-04 11:31:27,004 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-04 11:31:27,005 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:31:27,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:31:27,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:31:27,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:31:27 BoogieIcfgContainer [2025-03-04 11:31:27,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:31:27,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:31:27,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:31:27,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:31:27,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:31:26" (1/3) ... [2025-03-04 11:31:27,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7a968b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:31:27, skipping insertion in model container [2025-03-04 11:31:27,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:26" (2/3) ... [2025-03-04 11:31:27,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7a968b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:31:27, skipping insertion in model container [2025-03-04 11:31:27,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:31:27" (3/3) ... [2025-03-04 11:31:27,019 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2025-03-04 11:31:27,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:31:27,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_5.c that has 6 procedures, 70 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-04 11:31:27,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:31:27,076 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;@28632d78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:31:27,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 11:31:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:31:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:31:27,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:27,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:27,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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 8 more)] === [2025-03-04 11:31:27,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash -833184271, now seen corresponding path program 1 times [2025-03-04 11:31:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:27,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578033855] [2025-03-04 11:31:27,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:27,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:31:27,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:31:27,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:27,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:27,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:27,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578033855] [2025-03-04 11:31:27,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578033855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:27,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:27,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943276822] [2025-03-04 11:31:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:27,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:27,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:27,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:27,516 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 59 states have internal predecessors, (64), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:31:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:27,781 INFO L93 Difference]: Finished difference Result 140 states and 171 transitions. [2025-03-04 11:31:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:27,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 11:31:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:27,787 INFO L225 Difference]: With dead ends: 140 [2025-03-04 11:31:27,788 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 11:31:27,791 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-03-04 11:31:27,794 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:27,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 158 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 11:31:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 11:31:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 45 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 11:31:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-03-04 11:31:27,832 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 12 [2025-03-04 11:31:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:27,832 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-03-04 11:31:27,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:31:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-03-04 11:31:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:31:27,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:27,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:27,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:31:27,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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 8 more)] === [2025-03-04 11:31:27,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash -120203960, now seen corresponding path program 1 times [2025-03-04 11:31:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:27,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437544542] [2025-03-04 11:31:27,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:27,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:31:27,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:31:27,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:27,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:28,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437544542] [2025-03-04 11:31:28,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437544542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:28,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:28,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073407749] [2025-03-04 11:31:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:28,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:28,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:28,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:28,019 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:31:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:28,083 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2025-03-04 11:31:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:28,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 11:31:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:28,085 INFO L225 Difference]: With dead ends: 66 [2025-03-04 11:31:28,085 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 11:31:28,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:28,086 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 274 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-03-04 11:31:28,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 274 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 11:31:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 11:31:28,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 49 states have internal predecessors, (50), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 11:31:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-03-04 11:31:28,093 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 15 [2025-03-04 11:31:28,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:28,093 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-03-04 11:31:28,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:31:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-03-04 11:31:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 11:31:28,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:28,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:28,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:31:28,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:28,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash 778329638, now seen corresponding path program 1 times [2025-03-04 11:31:28,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:28,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719700985] [2025-03-04 11:31:28,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:28,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:31:28,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:31:28,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:28,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:28,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:28,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719700985] [2025-03-04 11:31:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719700985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:28,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:28,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:28,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349692059] [2025-03-04 11:31:28,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:28,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:28,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:28,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:28,251 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (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-03-04 11:31:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:28,309 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2025-03-04 11:31:28,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:28,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (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 18 [2025-03-04 11:31:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:28,311 INFO L225 Difference]: With dead ends: 126 [2025-03-04 11:31:28,312 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 11:31:28,313 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-03-04 11:31:28,313 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 273 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-03-04 11:31:28,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 273 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 11:31:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-03-04 11:31:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.358974358974359) internal successors, (53), 51 states have internal predecessors, (53), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 11:31:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-03-04 11:31:28,324 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 18 [2025-03-04 11:31:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:28,324 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-03-04 11:31:28,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (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-03-04 11:31:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-03-04 11:31:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:31:28,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:28,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:28,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:31:28,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:28,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1641585005, now seen corresponding path program 1 times [2025-03-04 11:31:28,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:28,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910957191] [2025-03-04 11:31:28,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:28,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:28,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:31:28,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:31:28,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:28,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:28,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:28,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910957191] [2025-03-04 11:31:28,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910957191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:28,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:31:28,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912736095] [2025-03-04 11:31:28,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:28,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:31:28,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:28,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:31:28,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:31:28,398 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:28,413 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-03-04 11:31:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:31:28,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 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-03-04 11:31:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:28,414 INFO L225 Difference]: With dead ends: 65 [2025-03-04 11:31:28,414 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 11:31:28,414 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-03-04 11:31:28,415 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 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-03-04 11:31:28,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 11:31:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 11:31:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 50 states have internal predecessors, (52), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 11:31:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2025-03-04 11:31:28,425 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 19 [2025-03-04 11:31:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:28,425 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2025-03-04 11:31:28,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2025-03-04 11:31:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 11:31:28,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:28,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:28,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:31:28,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:28,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash 777904524, now seen corresponding path program 1 times [2025-03-04 11:31:28,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:28,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40304891] [2025-03-04 11:31:28,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:28,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:28,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:31:28,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:31:28,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:28,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:28,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:28,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40304891] [2025-03-04 11:31:28,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40304891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:28,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:28,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:28,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198406438] [2025-03-04 11:31:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:28,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:28,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:28,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:28,567 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:31:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:28,641 INFO L93 Difference]: Finished difference Result 133 states and 159 transitions. [2025-03-04 11:31:28,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:31:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 11:31:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:28,644 INFO L225 Difference]: With dead ends: 133 [2025-03-04 11:31:28,644 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 11:31:28,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:31:28,645 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:28,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 261 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 11:31:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-03-04 11:31:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.302325581395349) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-04 11:31:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2025-03-04 11:31:28,656 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 18 [2025-03-04 11:31:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:28,656 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2025-03-04 11:31:28,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:31:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2025-03-04 11:31:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 11:31:28,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:28,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:28,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:31:28,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:28,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1654763550, now seen corresponding path program 1 times [2025-03-04 11:31:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:28,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741519331] [2025-03-04 11:31:28,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:28,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 11:31:28,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 11:31:28,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:28,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:28,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741519331] [2025-03-04 11:31:28,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741519331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:28,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:28,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:31:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205542017] [2025-03-04 11:31:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:28,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:31:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:28,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:31:28,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:31:28,755 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:31:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:28,788 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2025-03-04 11:31:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:31:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 11:31:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:28,789 INFO L225 Difference]: With dead ends: 69 [2025-03-04 11:31:28,789 INFO L226 Difference]: Without dead ends: 68 [2025-03-04 11:31:28,790 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-03-04 11:31:28,790 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:28,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 206 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-04 11:31:28,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-04 11:31:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-04 11:31:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-04 11:31:28,797 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2025-03-04 11:31:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:28,797 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-04 11:31:28,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:31:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-03-04 11:31:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:31:28,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:28,798 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] [2025-03-04 11:31:28,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:31:28,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:28,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:28,798 INFO L85 PathProgramCache]: Analyzing trace with hash -667652870, now seen corresponding path program 1 times [2025-03-04 11:31:28,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:28,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550223140] [2025-03-04 11:31:28,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:28,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:28,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:31:28,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:31:28,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:28,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550223140] [2025-03-04 11:31:28,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550223140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:28,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:28,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38576837] [2025-03-04 11:31:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:28,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:28,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:28,950 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:29,013 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2025-03-04 11:31:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:31:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-04 11:31:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:29,014 INFO L225 Difference]: With dead ends: 74 [2025-03-04 11:31:29,014 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 11:31:29,014 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-03-04 11:31:29,014 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 11 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:29,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 211 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 11:31:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-03-04 11:31:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.255813953488372) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 11:31:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-04 11:31:29,022 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 23 [2025-03-04 11:31:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:29,022 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-04 11:31:29,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-03-04 11:31:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:31:29,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:29,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:29,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:31:29,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:29,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1589706898, now seen corresponding path program 1 times [2025-03-04 11:31:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252174528] [2025-03-04 11:31:29,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:29,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:29,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:31:29,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:31:29,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:29,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:31:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252174528] [2025-03-04 11:31:29,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252174528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:29,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:29,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:29,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142155817] [2025-03-04 11:31:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:29,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:29,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:29,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:29,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:29,151 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:31:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:29,203 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2025-03-04 11:31:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:29,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-04 11:31:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:29,204 INFO L225 Difference]: With dead ends: 85 [2025-03-04 11:31:29,204 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 11:31:29,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:29,205 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:29,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 251 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 11:31:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2025-03-04 11:31:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 57 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 11:31:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-03-04 11:31:29,211 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 28 [2025-03-04 11:31:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:29,211 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-03-04 11:31:29,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:31:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-03-04 11:31:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:31:29,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:29,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:29,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:31:29,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash -496755411, now seen corresponding path program 1 times [2025-03-04 11:31:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406560860] [2025-03-04 11:31:29,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:29,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:29,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:31:29,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:31:29,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:29,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:31:29,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406560860] [2025-03-04 11:31:29,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406560860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:29,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305954978] [2025-03-04 11:31:29,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:29,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:29,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:29,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:29,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:31:29,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:31:29,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:31:29,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:29,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:29,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 11:31:29,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:29,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:29,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 11:31:29,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:31:29,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:29,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305954978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:29,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:29,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2025-03-04 11:31:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837625440] [2025-03-04 11:31:29,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:29,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:29,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:29,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:29,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:31:29,544 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:31:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:29,633 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2025-03-04 11:31:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:29,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-04 11:31:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:29,634 INFO L225 Difference]: With dead ends: 153 [2025-03-04 11:31:29,634 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 11:31:29,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:31:29,637 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:29,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 171 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 11:31:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-04 11:31:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.22) internal successors, (61), 57 states have internal predecessors, (61), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 11:31:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2025-03-04 11:31:29,644 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 29 [2025-03-04 11:31:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:29,644 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2025-03-04 11:31:29,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:31:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2025-03-04 11:31:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:31:29,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:29,645 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:29,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:31:29,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:29,849 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:29,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:29,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1333861163, now seen corresponding path program 1 times [2025-03-04 11:31:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:29,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329116444] [2025-03-04 11:31:29,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:29,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:29,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:31:29,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:31:29,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:29,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 11:31:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329116444] [2025-03-04 11:31:30,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329116444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854341772] [2025-03-04 11:31:30,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:30,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:30,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:30,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:30,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:31:30,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:31:30,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:31:30,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:30,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:30,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:31:30,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:30,318 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-03-04 11:31:30,419 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-03-04 11:31:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:31:30,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:30,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854341772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:30,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:30,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-03-04 11:31:30,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598944092] [2025-03-04 11:31:30,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:30,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:30,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:30,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:31:30,436 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:31:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:30,551 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2025-03-04 11:31:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:31:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2025-03-04 11:31:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:30,552 INFO L225 Difference]: With dead ends: 81 [2025-03-04 11:31:30,552 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:31:30,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:31:30,553 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 58 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:30,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 174 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:31:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2025-03-04 11:31:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.2) internal successors, (60), 56 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 11:31:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-03-04 11:31:30,569 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 46 [2025-03-04 11:31:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:30,569 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-03-04 11:31:30,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:31:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-03-04 11:31:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:31:30,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:30,571 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:30,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:30,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 11:31:30,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:30,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1599976909, now seen corresponding path program 1 times [2025-03-04 11:31:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:30,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117610251] [2025-03-04 11:31:30,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:30,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:31:30,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:31:30,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:30,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:31:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117610251] [2025-03-04 11:31:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117610251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:30,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:31:30,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496564038] [2025-03-04 11:31:30,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:30,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:31:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:30,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:31:30,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:31:30,862 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:31:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:30,890 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-03-04 11:31:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:31:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-03-04 11:31:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:30,892 INFO L225 Difference]: With dead ends: 77 [2025-03-04 11:31:30,892 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 11:31:30,892 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-03-04 11:31:30,893 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:30,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 11:31:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-03-04 11:31:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-03-04 11:31:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-03-04 11:31:30,903 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 47 [2025-03-04 11:31:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:30,903 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-03-04 11:31:30,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:31:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-03-04 11:31:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 11:31:30,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:30,907 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:30,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:31:30,907 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:30,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash -641521523, now seen corresponding path program 1 times [2025-03-04 11:31:30,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:30,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917136166] [2025-03-04 11:31:30,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:30,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:30,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:31:30,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:31:30,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:30,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-04 11:31:31,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917136166] [2025-03-04 11:31:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917136166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752789115] [2025-03-04 11:31:31,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:31,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:31,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:31,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:31,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:31:31,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 11:31:31,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 11:31:31,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:31,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:31,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 11:31:31,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:31,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 40 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:31:31,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 11:31:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752789115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:31,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-03-04 11:31:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626068517] [2025-03-04 11:31:31,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:31,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 11:31:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:31,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 11:31:31,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:31:31,976 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 27 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 23 states have internal predecessors, (64), 9 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-04 11:31:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:32,385 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2025-03-04 11:31:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:31:32,386 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 23 states have internal predecessors, (64), 9 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) Word has length 69 [2025-03-04 11:31:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:32,387 INFO L225 Difference]: With dead ends: 145 [2025-03-04 11:31:32,387 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 11:31:32,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1261, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:31:32,389 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:32,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 429 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 11:31:32,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 11:31:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-04 11:31:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2025-03-04 11:31:32,402 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 69 [2025-03-04 11:31:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:32,402 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2025-03-04 11:31:32,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 23 states have internal predecessors, (64), 9 states have call successors, (19), 6 states have call predecessors, (19), 8 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2025-03-04 11:31:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2025-03-04 11:31:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 11:31:32,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:32,403 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:32,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:32,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:32,608 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 11:31:32,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash 687588845, now seen corresponding path program 2 times [2025-03-04 11:31:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277671531] [2025-03-04 11:31:32,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:31:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:32,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-04 11:31:32,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 11:31:32,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:31:32,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-04 11:31:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277671531] [2025-03-04 11:31:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277671531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138250168] [2025-03-04 11:31:32,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:31:32,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:32,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:32,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:32,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:31:33,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-04 11:31:33,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 11:31:33,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:31:33,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:33,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-04 11:31:33,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:33,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 160 proven. 8 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-04 11:31:33,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 7 proven. 180 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-04 11:31:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138250168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:34,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:34,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 16] total 40 [2025-03-04 11:31:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897981410] [2025-03-04 11:31:34,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:34,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 11:31:34,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:34,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 11:31:34,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 11:31:34,425 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 40 states, 33 states have (on average 2.484848484848485) internal successors, (82), 31 states have internal predecessors, (82), 14 states have call successors, (27), 11 states have call predecessors, (27), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-04 11:31:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:35,153 INFO L93 Difference]: Finished difference Result 154 states and 191 transitions. [2025-03-04 11:31:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 11:31:35,153 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 33 states have (on average 2.484848484848485) internal successors, (82), 31 states have internal predecessors, (82), 14 states have call successors, (27), 11 states have call predecessors, (27), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) Word has length 137 [2025-03-04 11:31:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:35,154 INFO L225 Difference]: With dead ends: 154 [2025-03-04 11:31:35,154 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 11:31:35,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=377, Invalid=3405, Unknown=0, NotChecked=0, Total=3782 [2025-03-04 11:31:35,156 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 111 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:35,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 723 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:31:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 11:31:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2025-03-04 11:31:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (16), 12 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-04 11:31:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2025-03-04 11:31:35,163 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 137 [2025-03-04 11:31:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:35,163 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2025-03-04 11:31:35,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 33 states have (on average 2.484848484848485) internal successors, (82), 31 states have internal predecessors, (82), 14 states have call successors, (27), 11 states have call predecessors, (27), 8 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2025-03-04 11:31:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2025-03-04 11:31:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:31:35,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:35,164 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:35,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:35,368 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 8 more)] === [2025-03-04 11:31:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash -684799713, now seen corresponding path program 1 times [2025-03-04 11:31:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253013173] [2025-03-04 11:31:35,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:35,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:31:35,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:31:35,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 11:31:35,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:35,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253013173] [2025-03-04 11:31:35,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253013173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:35,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100280566] [2025-03-04 11:31:35,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:35,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:35,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:35,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:35,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:31:35,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:31:35,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:31:35,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:35,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:35,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:31:35,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:35,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-03-04 11:31:36,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:36,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100280566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:36,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:36,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-03-04 11:31:36,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061322376] [2025-03-04 11:31:36,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:36,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:36,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:31:36,041 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:31:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:36,123 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2025-03-04 11:31:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:36,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 106 [2025-03-04 11:31:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:36,125 INFO L225 Difference]: With dead ends: 144 [2025-03-04 11:31:36,125 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 11:31:36,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:31:36,126 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:36,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 254 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 11:31:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2025-03-04 11:31:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 96 states have internal predecessors, (107), 20 states have call successors, (20), 18 states have call predecessors, (20), 22 states have return successors, (32), 24 states have call predecessors, (32), 18 states have call successors, (32) [2025-03-04 11:31:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2025-03-04 11:31:36,143 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 106 [2025-03-04 11:31:36,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:36,144 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2025-03-04 11:31:36,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:31:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2025-03-04 11:31:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 11:31:36,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:36,145 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:36,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 11:31:36,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:31:36,347 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 8 more)] === [2025-03-04 11:31:36,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:36,347 INFO L85 PathProgramCache]: Analyzing trace with hash 246045390, now seen corresponding path program 1 times [2025-03-04 11:31:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:36,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-04 11:31:36,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:36,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:31:36,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:31:36,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:36,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 11:31:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:36,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536229279] [2025-03-04 11:31:36,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536229279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:36,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684936755] [2025-03-04 11:31:36,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:36,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:36,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:36,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:36,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:31:36,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:31:36,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:31:36,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:36,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:36,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:31:36,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:36,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-03-04 11:31:36,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:36,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684936755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:36,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:36,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-04 11:31:36,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751492715] [2025-03-04 11:31:36,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:36,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:36,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:36,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:36,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:31:36,939 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:31:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:37,009 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2025-03-04 11:31:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:37,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 107 [2025-03-04 11:31:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:37,010 INFO L225 Difference]: With dead ends: 139 [2025-03-04 11:31:37,010 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 11:31:37,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:31:37,012 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:37,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:31:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 11:31:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 11:31:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 93 states have (on average 1.1397849462365592) internal successors, (106), 95 states have internal predecessors, (106), 20 states have call successors, (20), 18 states have call predecessors, (20), 22 states have return successors, (32), 24 states have call predecessors, (32), 18 states have call successors, (32) [2025-03-04 11:31:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2025-03-04 11:31:37,023 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 107 [2025-03-04 11:31:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:37,023 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2025-03-04 11:31:37,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 11:31:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2025-03-04 11:31:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 11:31:37,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:37,024 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2025-03-04 11:31:37,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:37,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:31:37,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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 8 more)] === [2025-03-04 11:31:37,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1316241076, now seen corresponding path program 1 times [2025-03-04 11:31:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:37,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607620528] [2025-03-04 11:31:37,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:37,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 11:31:37,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 11:31:37,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:37,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2025-03-04 11:31:37,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:37,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607620528] [2025-03-04 11:31:37,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607620528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526829158] [2025-03-04 11:31:37,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:37,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:37,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:37,610 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:37,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:31:37,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 11:31:37,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 11:31:37,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:37,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:37,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 11:31:37,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:37,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 296 proven. 15 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2025-03-04 11:31:38,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 9 proven. 335 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-04 11:31:39,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526829158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:39,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 21] total 39 [2025-03-04 11:31:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174974952] [2025-03-04 11:31:39,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:39,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 11:31:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:39,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 11:31:39,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:31:39,431 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand has 39 states, 31 states have (on average 2.967741935483871) internal successors, (92), 33 states have internal predecessors, (92), 11 states have call successors, (27), 8 states have call predecessors, (27), 12 states have return successors, (27), 10 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-04 11:31:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:40,025 INFO L93 Difference]: Finished difference Result 275 states and 335 transitions. [2025-03-04 11:31:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 11:31:40,025 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.967741935483871) internal successors, (92), 33 states have internal predecessors, (92), 11 states have call successors, (27), 8 states have call predecessors, (27), 12 states have return successors, (27), 10 states have call predecessors, (27), 11 states have call successors, (27) Word has length 188 [2025-03-04 11:31:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:40,026 INFO L225 Difference]: With dead ends: 275 [2025-03-04 11:31:40,026 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 11:31:40,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=432, Invalid=2430, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 11:31:40,028 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 73 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:40,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 427 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:31:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 11:31:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 11:31:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.134020618556701) internal successors, (110), 99 states have internal predecessors, (110), 20 states have call successors, (20), 18 states have call predecessors, (20), 26 states have return successors, (36), 28 states have call predecessors, (36), 18 states have call successors, (36) [2025-03-04 11:31:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2025-03-04 11:31:40,041 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 188 [2025-03-04 11:31:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:40,041 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2025-03-04 11:31:40,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.967741935483871) internal successors, (92), 33 states have internal predecessors, (92), 11 states have call successors, (27), 8 states have call predecessors, (27), 12 states have return successors, (27), 10 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-04 11:31:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2025-03-04 11:31:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-04 11:31:40,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:40,044 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 32, 32, 32, 32, 32, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:40,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:40,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:40,245 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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 8 more)] === [2025-03-04 11:31:40,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1016558154, now seen corresponding path program 2 times [2025-03-04 11:31:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:40,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936957634] [2025-03-04 11:31:40,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:31:40,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:40,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 406 statements into 2 equivalence classes. [2025-03-04 11:31:40,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 11:31:40,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:31:40,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5107 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5102 trivial. 0 not checked. [2025-03-04 11:31:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936957634] [2025-03-04 11:31:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936957634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70095627] [2025-03-04 11:31:41,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:31:41,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:41,046 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:41,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:31:41,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 406 statements into 2 equivalence classes. [2025-03-04 11:31:41,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 11:31:41,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:31:41,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:41,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1759 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-04 11:31:41,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:41,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5107 backedges. 1081 proven. 24 refuted. 0 times theorem prover too weak. 4002 trivial. 0 not checked. [2025-03-04 11:31:41,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5107 backedges. 11 proven. 1165 refuted. 0 times theorem prover too weak. 3931 trivial. 0 not checked. [2025-03-04 11:31:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70095627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:43,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:43,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 26] total 45 [2025-03-04 11:31:43,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224456289] [2025-03-04 11:31:43,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:43,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 11:31:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:43,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 11:31:43,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1681, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 11:31:43,948 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand has 45 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 37 states have internal predecessors, (98), 12 states have call successors, (29), 10 states have call predecessors, (29), 12 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-04 11:31:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:44,452 INFO L93 Difference]: Finished difference Result 292 states and 361 transitions. [2025-03-04 11:31:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 11:31:44,453 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 37 states have internal predecessors, (98), 12 states have call successors, (29), 10 states have call predecessors, (29), 12 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) Word has length 406 [2025-03-04 11:31:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:44,455 INFO L225 Difference]: With dead ends: 292 [2025-03-04 11:31:44,455 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 11:31:44,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=474, Invalid=2948, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 11:31:44,456 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 70 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:44,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 651 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:31:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 11:31:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2025-03-04 11:31:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 100 states have internal predecessors, (110), 20 states have call successors, (20), 18 states have call predecessors, (20), 28 states have return successors, (38), 30 states have call predecessors, (38), 18 states have call successors, (38) [2025-03-04 11:31:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 168 transitions. [2025-03-04 11:31:44,471 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 168 transitions. Word has length 406 [2025-03-04 11:31:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:44,471 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 168 transitions. [2025-03-04 11:31:44,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 37 states have internal predecessors, (98), 12 states have call successors, (29), 10 states have call predecessors, (29), 12 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-04 11:31:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 168 transitions. [2025-03-04 11:31:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-04 11:31:44,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:44,475 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 40, 40, 40, 40, 40, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:44,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:31:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:31:44,679 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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 8 more)] === [2025-03-04 11:31:44,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1311569389, now seen corresponding path program 1 times [2025-03-04 11:31:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863889373] [2025-03-04 11:31:44,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:44,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 11:31:44,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 11:31:44,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:44,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7352 backedges. 6 proven. 64 refuted. 0 times theorem prover too weak. 7282 trivial. 0 not checked. [2025-03-04 11:31:45,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:45,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863889373] [2025-03-04 11:31:45,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863889373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:45,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886549254] [2025-03-04 11:31:45,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:45,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:45,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:45,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:45,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:31:46,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 11:31:46,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 11:31:46,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:46,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:46,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1944 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:31:46,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:46,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 11:31:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7352 backedges. 3789 proven. 0 refuted. 0 times theorem prover too weak. 3563 trivial. 0 not checked. [2025-03-04 11:31:46,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:46,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886549254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:46,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:46,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2025-03-04 11:31:46,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197142741] [2025-03-04 11:31:46,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:46,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:46,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:46,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:46,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:31:46,539 INFO L87 Difference]: Start difference. First operand 149 states and 168 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 11:31:50,593 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-03-04 11:31:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:50,603 INFO L93 Difference]: Finished difference Result 149 states and 168 transitions. [2025-03-04 11:31:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 463 [2025-03-04 11:31:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:50,605 INFO L225 Difference]: With dead ends: 149 [2025-03-04 11:31:50,605 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 11:31:50,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:31:50,605 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:50,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 156 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 11:31:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 11:31:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2025-03-04 11:31:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.096774193548387) internal successors, (102), 93 states have internal predecessors, (102), 18 states have call successors, (18), 18 states have call predecessors, (18), 28 states have return successors, (36), 28 states have call predecessors, (36), 16 states have call successors, (36) [2025-03-04 11:31:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2025-03-04 11:31:50,616 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 463 [2025-03-04 11:31:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:50,617 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2025-03-04 11:31:50,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 11:31:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2025-03-04 11:31:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-04 11:31:50,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:50,619 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 40, 40, 40, 40, 40, 12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:50,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:50,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:31:50,820 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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 8 more)] === [2025-03-04 11:31:50,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash 856452908, now seen corresponding path program 1 times [2025-03-04 11:31:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:50,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452797522] [2025-03-04 11:31:50,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:50,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-04 11:31:50,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-04 11:31:50,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:50,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7380 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 7353 trivial. 0 not checked. [2025-03-04 11:31:51,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452797522] [2025-03-04 11:31:51,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452797522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295655933] [2025-03-04 11:31:51,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:51,563 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:51,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:31:51,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-04 11:31:51,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-04 11:31:51,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:51,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:51,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 2110 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 11:31:51,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:51,900 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-03-04 11:31:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7380 backedges. 3808 proven. 3 refuted. 0 times theorem prover too weak. 3569 trivial. 0 not checked. [2025-03-04 11:31:52,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7380 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 7352 trivial. 0 not checked. [2025-03-04 11:31:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295655933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:53,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:53,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2025-03-04 11:31:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879829990] [2025-03-04 11:31:53,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:53,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 11:31:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:53,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 11:31:53,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2025-03-04 11:31:53,126 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand has 24 states, 18 states have (on average 5.222222222222222) internal successors, (94), 21 states have internal predecessors, (94), 10 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (25), 7 states have call predecessors, (25), 10 states have call successors, (25) [2025-03-04 11:31:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:53,382 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2025-03-04 11:31:53,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:31:53,384 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 5.222222222222222) internal successors, (94), 21 states have internal predecessors, (94), 10 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (25), 7 states have call predecessors, (25), 10 states have call successors, (25) Word has length 485 [2025-03-04 11:31:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:53,386 INFO L225 Difference]: With dead ends: 220 [2025-03-04 11:31:53,386 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 11:31:53,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 956 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:31:53,387 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:53,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 84 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 11:31:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 11:31:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 97 states have (on average 1.092783505154639) internal successors, (106), 97 states have internal predecessors, (106), 18 states have call successors, (18), 18 states have call predecessors, (18), 32 states have return successors, (40), 32 states have call predecessors, (40), 16 states have call successors, (40) [2025-03-04 11:31:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 164 transitions. [2025-03-04 11:31:53,405 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 164 transitions. Word has length 485 [2025-03-04 11:31:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:53,406 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 164 transitions. [2025-03-04 11:31:53,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 5.222222222222222) internal successors, (94), 21 states have internal predecessors, (94), 10 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (25), 7 states have call predecessors, (25), 10 states have call successors, (25) [2025-03-04 11:31:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 164 transitions. [2025-03-04 11:31:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1410 [2025-03-04 11:31:53,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:53,414 INFO L218 NwaCegarLoop]: trace histogram [144, 144, 120, 120, 120, 120, 120, 36, 36, 24, 24, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:53,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:31:53,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:53,615 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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 8 more)] === [2025-03-04 11:31:53,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1189641032, now seen corresponding path program 2 times [2025-03-04 11:31:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769475204] [2025-03-04 11:31:53,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:31:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:53,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1409 statements into 2 equivalence classes. [2025-03-04 11:31:53,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1409 of 1409 statements. [2025-03-04 11:31:53,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:31:53,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 67638 backedges. 12 proven. 321 refuted. 0 times theorem prover too weak. 67305 trivial. 0 not checked. [2025-03-04 11:31:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769475204] [2025-03-04 11:31:57,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769475204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:57,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270146391] [2025-03-04 11:31:57,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:31:57,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:57,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:57,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:57,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:31:58,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1409 statements into 2 equivalence classes. [2025-03-04 11:31:58,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1409 of 1409 statements. [2025-03-04 11:31:58,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:31:58,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:58,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 5726 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-04 11:31:58,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:58,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 67638 backedges. 5197 proven. 35 refuted. 0 times theorem prover too weak. 62406 trivial. 0 not checked. [2025-03-04 11:31:59,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:32:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 67638 backedges. 17 proven. 5410 refuted. 0 times theorem prover too weak. 62211 trivial. 0 not checked. [2025-03-04 11:32:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270146391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:32:04,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:32:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 31] total 54 [2025-03-04 11:32:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552281455] [2025-03-04 11:32:04,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:32:04,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-04 11:32:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:04,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-04 11:32:04,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2456, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 11:32:04,521 INFO L87 Difference]: Start difference. First operand 148 states and 164 transitions. Second operand has 54 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 46 states have internal predecessors, (120), 14 states have call successors, (34), 10 states have call predecessors, (34), 17 states have return successors, (38), 15 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-04 11:32:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:05,281 INFO L93 Difference]: Finished difference Result 296 states and 351 transitions. [2025-03-04 11:32:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 11:32:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 46 states have internal predecessors, (120), 14 states have call successors, (34), 10 states have call predecessors, (34), 17 states have return successors, (38), 15 states have call predecessors, (38), 14 states have call successors, (38) Word has length 1409 [2025-03-04 11:32:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:05,283 INFO L225 Difference]: With dead ends: 296 [2025-03-04 11:32:05,283 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 11:32:05,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2850 GetRequests, 2781 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2025-03-04 11:32:05,286 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 72 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:05,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 458 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:32:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 11:32:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-04 11:32:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.0891089108910892) internal successors, (110), 101 states have internal predecessors, (110), 18 states have call successors, (18), 18 states have call predecessors, (18), 36 states have return successors, (44), 36 states have call predecessors, (44), 16 states have call successors, (44) [2025-03-04 11:32:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2025-03-04 11:32:05,304 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 1409 [2025-03-04 11:32:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:05,304 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2025-03-04 11:32:05,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 43 states have (on average 2.7906976744186047) internal successors, (120), 46 states have internal predecessors, (120), 14 states have call successors, (34), 10 states have call predecessors, (34), 17 states have return successors, (38), 15 states have call predecessors, (38), 14 states have call successors, (38) [2025-03-04 11:32:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2025-03-04 11:32:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2316 [2025-03-04 11:32:05,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:32:05,327 INFO L218 NwaCegarLoop]: trace histogram [252, 252, 216, 216, 216, 216, 216, 54, 54, 36, 36, 36, 36, 36, 36, 36, 36, 36, 24, 24, 18, 18, 18, 18, 18, 18, 18, 18, 18, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:32:05,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:32:05,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:32:05,528 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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 8 more)] === [2025-03-04 11:32:05,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:32:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1998557776, now seen corresponding path program 3 times [2025-03-04 11:32:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:32:05,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251830766] [2025-03-04 11:32:05,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:32:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:32:05,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2315 statements into 16 equivalence classes. [2025-03-04 11:32:05,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 2315 statements. [2025-03-04 11:32:05,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 11:32:05,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:32:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 207099 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 207094 trivial. 0 not checked. [2025-03-04 11:32:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:32:05,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251830766] [2025-03-04 11:32:05,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251830766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:32:05,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:32:05,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:32:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231967433] [2025-03-04 11:32:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:32:05,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:32:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:32:05,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:32:05,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:32:05,749 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 11:32:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:32:05,808 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2025-03-04 11:32:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:32:05,808 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 2315 [2025-03-04 11:32:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:32:05,814 INFO L225 Difference]: With dead ends: 158 [2025-03-04 11:32:05,814 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:32:05,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:32:05,816 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:32:05,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 244 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:32:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:32:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:32:05,816 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-03-04 11:32:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:32:05,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2315 [2025-03-04 11:32:05,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:32:05,817 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:32:05,818 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 11:32:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:32:05,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:32:05,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-04 11:32:05,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-04 11:32:05,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:32:05,825 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:32:05,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:32:14,251 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 78 DAG size of output: 50 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-04 11:32:59,009 WARN L286 SmtUtils]: Spent 44.16s on a formula simplification. DAG size of input: 95 DAG size of output: 48 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)