./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.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_nla-digbench/recursified_ps2-ll.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 ad27d809606deb561fe152191ab0a1443c0552410f06ac9bb9a7a7bf17dec4e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:33:14,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:33:14,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:33:14,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:33:14,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:33:14,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:33:14,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:33:14,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:33:14,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:33:14,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:33:14,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:33:14,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:33:14,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:33:14,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:33:14,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:33:14,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:33:14,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:33:14,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:33:14,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:33:14,742 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 -> ad27d809606deb561fe152191ab0a1443c0552410f06ac9bb9a7a7bf17dec4e9 [2025-03-04 11:33:14,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:33:14,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:33:14,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:33:14,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:33:14,969 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:33:14,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c [2025-03-04 11:33:16,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c97a97d6/c94b63fc1beb4eab9df5d4abb0ac4130/FLAG3ca839a42 [2025-03-04 11:33:16,390 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:33:16,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c [2025-03-04 11:33:16,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c97a97d6/c94b63fc1beb4eab9df5d4abb0ac4130/FLAG3ca839a42 [2025-03-04 11:33:16,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c97a97d6/c94b63fc1beb4eab9df5d4abb0ac4130 [2025-03-04 11:33:16,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:33:16,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:33:16,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:33:16,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:33:16,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:33:16,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e76790c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16, skipping insertion in model container [2025-03-04 11:33:16,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:33:16,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:33:16,555 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:33:16,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:33:16,577 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:33:16,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16 WrapperNode [2025-03-04 11:33:16,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:33:16,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:33:16,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:33:16,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:33:16,582 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:33:16" (1/1) ... [2025-03-04 11:33:16,586 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:33:16" (1/1) ... [2025-03-04 11:33:16,598 INFO L138 Inliner]: procedures = 16, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-04 11:33:16,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:33:16,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:33:16,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:33:16,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:33:16,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,629 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 5, 10, 4, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 2, 2, 2, 1]. [2025-03-04 11:33:16,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:33:16,646 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:33:16,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:33:16,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:33:16,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (1/1) ... [2025-03-04 11:33:16,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:33:16,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:16,678 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:33:16,682 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:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:33:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:33:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:33:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:33:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:33:16,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:33:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:33:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:33:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:33:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:33:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:33:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_34_0 [2025-03-04 11:33:16,703 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_34_0 [2025-03-04 11:33:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:33:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:33:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:33:16,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:33:16,787 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:33:16,921 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~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; [2025-03-04 11:33:17,004 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-04 11:33:17,005 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:33:17,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:33:17,016 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:33:17,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:17 BoogieIcfgContainer [2025-03-04 11:33:17,017 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:33:17,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:33:17,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:33:17,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:33:17,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:33:16" (1/3) ... [2025-03-04 11:33:17,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5107a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:33:17, skipping insertion in model container [2025-03-04 11:33:17,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:16" (2/3) ... [2025-03-04 11:33:17,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5107a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:33:17, skipping insertion in model container [2025-03-04 11:33:17,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:17" (3/3) ... [2025-03-04 11:33:17,023 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps2-ll.c [2025-03-04 11:33:17,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:33:17,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps2-ll.c that has 3 procedures, 67 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-04 11:33:17,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:33:17,084 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;@364787e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:33:17,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 11:33:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:33:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:33:17,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:17,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:33:17,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_26_to_34_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:17,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1598081525, now seen corresponding path program 1 times [2025-03-04 11:33:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:17,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036735307] [2025-03-04 11:33:17,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:17,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:33:17,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:33:17,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:17,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:17,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413030120] [2025-03-04 11:33:17,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:17,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:17,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:17,201 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:33:17,202 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:33:17,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:33:17,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:33:17,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:17,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:17,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:33:17,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:17,345 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:33:17,411 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:33:17,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:17,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:17,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036735307] [2025-03-04 11:33:17,413 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:17,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413030120] [2025-03-04 11:33:17,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413030120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:17,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:17,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503496176] [2025-03-04 11:33:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:17,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:17,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:17,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:17,434 INFO L87 Difference]: Start difference. First operand has 67 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 61 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:17,631 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2025-03-04 11:33:17,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:17,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:33:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:17,638 INFO L225 Difference]: With dead ends: 172 [2025-03-04 11:33:17,638 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 11:33:17,642 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:33:17,646 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 75 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:17,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 257 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 11:33:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2025-03-04 11:33:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 68 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-04 11:33:17,679 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 6 [2025-03-04 11:33:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:17,680 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-04 11:33:17,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-04 11:33:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:33:17,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:17,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:17,688 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:33:17,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:33:17,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_26_to_34_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:17,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1841945581, now seen corresponding path program 1 times [2025-03-04 11:33:17,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:17,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370269670] [2025-03-04 11:33:17,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:17,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:17,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:33:17,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:33:17,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:17,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:18,152 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:33:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370269670] [2025-03-04 11:33:18,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370269670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:18,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:18,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745917318] [2025-03-04 11:33:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:18,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:18,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:18,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:18,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:18,154 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:18,263 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2025-03-04 11:33:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:18,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:33:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:18,264 INFO L225 Difference]: With dead ends: 98 [2025-03-04 11:33:18,264 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 11:33:18,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:18,265 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 65 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:18,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 231 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 11:33:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2025-03-04 11:33:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 68 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-03-04 11:33:18,276 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 8 [2025-03-04 11:33:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:18,276 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-03-04 11:33:18,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-03-04 11:33:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 11:33:18,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:18,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:18,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:33:18,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_26_to_34_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:18,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -583176655, now seen corresponding path program 1 times [2025-03-04 11:33:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:18,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032934012] [2025-03-04 11:33:18,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:18,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:33:18,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:33:18,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:18,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:18,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:18,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032934012] [2025-03-04 11:33:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032934012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:18,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145788223] [2025-03-04 11:33:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:18,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:18,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:18,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:18,458 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:18,585 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-03-04 11:33:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:18,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 11:33:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:18,587 INFO L225 Difference]: With dead ends: 96 [2025-03-04 11:33:18,587 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 11:33:18,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:18,587 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:18,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 240 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 11:33:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2025-03-04 11:33:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.565217391304348) internal successors, (72), 68 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-03-04 11:33:18,595 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 10 [2025-03-04 11:33:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:18,595 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-03-04 11:33:18,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-03-04 11:33:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 11:33:18,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:18,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:18,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:33:18,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_26_to_34_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:18,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:18,596 INFO L85 PathProgramCache]: Analyzing trace with hash -898607102, now seen corresponding path program 1 times [2025-03-04 11:33:18,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:18,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133707514] [2025-03-04 11:33:18,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:18,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:18,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 11:33:18,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 11:33:18,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:18,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:18,788 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:33:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:18,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133707514] [2025-03-04 11:33:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133707514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:18,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:18,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014132207] [2025-03-04 11:33:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:18,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:18,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:18,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:18,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:18,789 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:18,930 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2025-03-04 11:33:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:18,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 11:33:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:18,932 INFO L225 Difference]: With dead ends: 95 [2025-03-04 11:33:18,933 INFO L226 Difference]: Without dead ends: 94 [2025-03-04 11:33:18,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:18,934 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 58 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:18,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 231 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-04 11:33:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2025-03-04 11:33:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 68 states have internal predecessors, (71), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-03-04 11:33:18,944 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 11 [2025-03-04 11:33:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:18,944 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-03-04 11:33:18,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-03-04 11:33:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 11:33:18,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:18,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:18,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:33:18,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_26_to_34_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:18,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2087016369, now seen corresponding path program 1 times [2025-03-04 11:33:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:18,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343462806] [2025-03-04 11:33:18,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:18,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 11:33:18,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 11:33:18,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:18,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343462806] [2025-03-04 11:33:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343462806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:19,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:19,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260090375] [2025-03-04 11:33:19,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:19,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:19,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:19,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:19,075 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:19,205 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2025-03-04 11:33:19,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:19,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 11:33:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:19,207 INFO L225 Difference]: With dead ends: 98 [2025-03-04 11:33:19,207 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 11:33:19,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:19,208 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:19,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 266 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 11:33:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2025-03-04 11:33:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 68 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2025-03-04 11:33:19,216 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 12 [2025-03-04 11:33:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:19,216 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2025-03-04 11:33:19,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2025-03-04 11:33:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 11:33:19,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:19,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:19,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:33:19,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_26_to_34_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:19,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash -272997984, now seen corresponding path program 1 times [2025-03-04 11:33:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762645414] [2025-03-04 11:33:19,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:19,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 11:33:19,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 11:33:19,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:19,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:19,488 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:33:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762645414] [2025-03-04 11:33:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762645414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:19,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:19,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6473589] [2025-03-04 11:33:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:19,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:19,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:19,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:19,490 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:19,706 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2025-03-04 11:33:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 11:33:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:19,707 INFO L225 Difference]: With dead ends: 89 [2025-03-04 11:33:19,707 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 11:33:19,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:19,708 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 47 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:19,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 251 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 11:33:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2025-03-04 11:33:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5) internal successors, (69), 68 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2025-03-04 11:33:19,713 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 13 [2025-03-04 11:33:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:19,713 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2025-03-04 11:33:19,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2025-03-04 11:33:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 11:33:19,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:19,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:19,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:33:19,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_26_to_34_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:19,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1826955950, now seen corresponding path program 1 times [2025-03-04 11:33:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:19,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-04 11:33:19,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:19,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:19,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 11:33:19,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 11:33:19,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:19,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:19,879 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:33:19,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:19,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595045774] [2025-03-04 11:33:19,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595045774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:19,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:19,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:19,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106320545] [2025-03-04 11:33:19,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:19,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:19,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:19,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:19,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:19,882 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:33:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:19,947 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2025-03-04 11:33:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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 21 [2025-03-04 11:33:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:19,949 INFO L225 Difference]: With dead ends: 96 [2025-03-04 11:33:19,949 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 11:33:19,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:19,950 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 38 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:19,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 269 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:19,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 11:33:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 76. [2025-03-04 11:33:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 69 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-04 11:33:19,961 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 21 [2025-03-04 11:33:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:19,962 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-04 11:33:19,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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:33:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-04 11:33:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 11:33:19,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:19,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:19,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:33:19,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_26_to_34_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:19,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:19,964 INFO L85 PathProgramCache]: Analyzing trace with hash -801059597, now seen corresponding path program 1 times [2025-03-04 11:33:19,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:19,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536831923] [2025-03-04 11:33:19,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:19,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:19,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 11:33:19,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 11:33:19,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:19,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:20,096 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:33:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536831923] [2025-03-04 11:33:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536831923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:20,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522976143] [2025-03-04 11:33:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:20,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:20,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:20,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:20,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:20,099 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:33:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:20,169 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2025-03-04 11:33:20,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:20,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 22 [2025-03-04 11:33:20,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:20,170 INFO L225 Difference]: With dead ends: 76 [2025-03-04 11:33:20,170 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 11:33:20,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:20,171 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:20,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 220 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:20,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 11:33:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-04 11:33:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 68 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2025-03-04 11:33:20,180 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 22 [2025-03-04 11:33:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:20,180 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2025-03-04 11:33:20,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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:33:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2025-03-04 11:33:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:33:20,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:20,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:20,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:33:20,181 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_26_to_34_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:20,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash 936956272, now seen corresponding path program 1 times [2025-03-04 11:33:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783627876] [2025-03-04 11:33:20,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:20,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:33:20,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:33:20,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:20,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:20,278 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:33:20,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:20,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783627876] [2025-03-04 11:33:20,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783627876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:20,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:20,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:20,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120437893] [2025-03-04 11:33:20,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:20,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:20,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:20,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:20,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:20,279 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:33:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:20,334 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2025-03-04 11:33:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 23 [2025-03-04 11:33:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:20,335 INFO L225 Difference]: With dead ends: 93 [2025-03-04 11:33:20,335 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 11:33:20,335 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:33:20,336 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:20,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 244 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 11:33:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2025-03-04 11:33:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.44) internal successors, (72), 71 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:33:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2025-03-04 11:33:20,340 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 23 [2025-03-04 11:33:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:20,341 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2025-03-04 11:33:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:33:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2025-03-04 11:33:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:33:20,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:20,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:20,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:33:20,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:20,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1020132229, now seen corresponding path program 1 times [2025-03-04 11:33:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731659974] [2025-03-04 11:33:20,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:20,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:33:20,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:33:20,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:20,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062574041] [2025-03-04 11:33:20,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:20,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:20,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:20,365 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:33:20,367 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:33:20,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:33:20,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:33:20,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:20,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:20,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:33:20,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:20,438 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:33:20,469 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:33:20,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731659974] [2025-03-04 11:33:20,470 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062574041] [2025-03-04 11:33:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062574041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:20,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:20,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:20,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218481442] [2025-03-04 11:33:20,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:33:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:20,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:33:20,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:20,471 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:20,551 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2025-03-04 11:33:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:20,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-04 11:33:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:20,552 INFO L225 Difference]: With dead ends: 95 [2025-03-04 11:33:20,552 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 11:33:20,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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:33:20,553 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 37 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:20,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 133 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 11:33:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2025-03-04 11:33:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 74 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2025-03-04 11:33:20,558 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 24 [2025-03-04 11:33:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:20,560 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2025-03-04 11:33:20,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2025-03-04 11:33:20,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:33:20,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:20,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:20,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:33:20,761 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:33:20,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_26_to_34_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:20,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1528154738, now seen corresponding path program 1 times [2025-03-04 11:33:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361304329] [2025-03-04 11:33:20,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:20,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:20,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:33:20,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:33:20,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:20,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:20,972 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:33:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361304329] [2025-03-04 11:33:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361304329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:20,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526938427] [2025-03-04 11:33:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:20,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:20,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:20,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:20,975 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:33:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:21,065 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-03-04 11:33:21,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:21,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 25 [2025-03-04 11:33:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:21,066 INFO L225 Difference]: With dead ends: 86 [2025-03-04 11:33:21,066 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 11:33:21,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:33:21,067 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:21,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 263 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 11:33:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2025-03-04 11:33:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.4) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2025-03-04 11:33:21,074 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 25 [2025-03-04 11:33:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:21,074 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2025-03-04 11:33:21,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:33:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2025-03-04 11:33:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:33:21,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:21,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:21,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:33:21,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:21,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1094528999, now seen corresponding path program 1 times [2025-03-04 11:33:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:21,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900945742] [2025-03-04 11:33:21,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:21,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:33:21,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:33:21,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:21,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:21,146 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:33:21,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:21,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900945742] [2025-03-04 11:33:21,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900945742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:21,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:21,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340769266] [2025-03-04 11:33:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:21,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:33:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:21,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:33:21,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:21,148 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:21,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:21,210 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2025-03-04 11:33:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:33:21,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-04 11:33:21,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:21,211 INFO L225 Difference]: With dead ends: 92 [2025-03-04 11:33:21,211 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 11:33:21,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:21,211 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:21,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 127 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:21,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 11:33:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-03-04 11:33:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 77 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2025-03-04 11:33:21,220 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 26 [2025-03-04 11:33:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:21,221 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2025-03-04 11:33:21,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2025-03-04 11:33:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:33:21,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:21,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:21,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:33:21,222 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_26_to_34_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:21,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:21,223 INFO L85 PathProgramCache]: Analyzing trace with hash -128156625, now seen corresponding path program 1 times [2025-03-04 11:33:21,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:21,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578157382] [2025-03-04 11:33:21,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:21,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:33:21,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:33:21,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:21,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:21,410 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:33:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578157382] [2025-03-04 11:33:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578157382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:21,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:21,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:21,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842773125] [2025-03-04 11:33:21,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:21,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:21,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:21,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:21,412 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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:33:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:21,504 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2025-03-04 11:33:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:21,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 26 [2025-03-04 11:33:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:21,505 INFO L225 Difference]: With dead ends: 88 [2025-03-04 11:33:21,505 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 11:33:21,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:33:21,506 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 23 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:21,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 268 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 11:33:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-04 11:33:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 78 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2025-03-04 11:33:21,512 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 26 [2025-03-04 11:33:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:21,513 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2025-03-04 11:33:21,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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:33:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2025-03-04 11:33:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:33:21,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:21,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:21,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:33:21,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:21,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash 424618935, now seen corresponding path program 1 times [2025-03-04 11:33:21,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:21,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343383024] [2025-03-04 11:33:21,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:21,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:33:21,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:33:21,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:21,605 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:33:21,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343383024] [2025-03-04 11:33:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343383024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:21,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893345406] [2025-03-04 11:33:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:21,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:21,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:21,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:21,608 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:21,683 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-03-04 11:33:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-04 11:33:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:21,684 INFO L225 Difference]: With dead ends: 92 [2025-03-04 11:33:21,684 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 11:33:21,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:21,685 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:21,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 158 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 11:33:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2025-03-04 11:33:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 79 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2025-03-04 11:33:21,689 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 28 [2025-03-04 11:33:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2025-03-04 11:33:21,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2025-03-04 11:33:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:33:21,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:21,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:33:21,692 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 278285076, now seen corresponding path program 1 times [2025-03-04 11:33:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738879007] [2025-03-04 11:33:21,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:21,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:33:21,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:33:21,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:21,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:21,754 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:33:21,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:21,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738879007] [2025-03-04 11:33:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738879007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:21,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15449690] [2025-03-04 11:33:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:21,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:33:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:21,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:33:21,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:21,755 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:21,883 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-03-04 11:33:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:33:21,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 11:33:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:21,884 INFO L225 Difference]: With dead ends: 92 [2025-03-04 11:33:21,884 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 11:33:21,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:21,885 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 24 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:21,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 129 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 11:33:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2025-03-04 11:33:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 80 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 11:33:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2025-03-04 11:33:21,888 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 29 [2025-03-04 11:33:21,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:21,889 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2025-03-04 11:33:21,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2025-03-04 11:33:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:33:21,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:21,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:21,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:33:21,889 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_26_to_34_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:21,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:21,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1080672545, now seen corresponding path program 1 times [2025-03-04 11:33:21,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:21,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379437405] [2025-03-04 11:33:21,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:21,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:21,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:33:21,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:33:21,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:21,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:21,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2036651199] [2025-03-04 11:33:21,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:21,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:21,908 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:33:21,910 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:33:21,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:33:21,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:33:21,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:21,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:21,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:33:21,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:22,002 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:33:22,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:22,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 11:33:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:22,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:22,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379437405] [2025-03-04 11:33:22,431 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:22,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036651199] [2025-03-04 11:33:22,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036651199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:22,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:33:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 11:33:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501219073] [2025-03-04 11:33:22,431 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:22,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:33:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:22,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:33:22,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:33:22,432 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:22,579 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2025-03-04 11:33:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:33:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 11:33:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:22,580 INFO L225 Difference]: With dead ends: 130 [2025-03-04 11:33:22,580 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 11:33:22,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:33:22,581 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 101 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:22,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 279 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 11:33:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2025-03-04 11:33:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 98 states have internal predecessors, (107), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 11:33:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2025-03-04 11:33:22,587 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 30 [2025-03-04 11:33:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:22,587 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2025-03-04 11:33:22,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2025-03-04 11:33:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:33:22,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:22,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:22,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:33:22,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:22,791 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:22,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash 36902741, now seen corresponding path program 1 times [2025-03-04 11:33:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:22,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724819725] [2025-03-04 11:33:22,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:22,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:22,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:33:22,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:33:22,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:22,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:22,946 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:33:22,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724819725] [2025-03-04 11:33:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724819725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897786168] [2025-03-04 11:33:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:22,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:22,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:22,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:22,948 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:23,036 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2025-03-04 11:33:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:23,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-03-04 11:33:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:23,037 INFO L225 Difference]: With dead ends: 114 [2025-03-04 11:33:23,037 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 11:33:23,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:23,037 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:23,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 153 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 11:33:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-04 11:33:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 99 states have internal predecessors, (108), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 11:33:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2025-03-04 11:33:23,043 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 30 [2025-03-04 11:33:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:23,043 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2025-03-04 11:33:23,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2025-03-04 11:33:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:33:23,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:23,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:33:23,044 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_26_to_34_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:23,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash -858889446, now seen corresponding path program 1 times [2025-03-04 11:33:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635185333] [2025-03-04 11:33:23,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:23,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:33:23,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:33:23,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:23,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194963956] [2025-03-04 11:33:23,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:23,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:23,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:23,066 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:33:23,068 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:33:23,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:33:23,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:33:23,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:23,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:23,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 11:33:23,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:23,147 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:33:23,243 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:33:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:23,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635185333] [2025-03-04 11:33:27,681 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194963956] [2025-03-04 11:33:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194963956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:27,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:33:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 11:33:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751439277] [2025-03-04 11:33:27,682 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:33:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:27,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:33:27,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2025-03-04 11:33:27,683 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:27,898 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2025-03-04 11:33:27,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:33:27,898 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-04 11:33:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:27,899 INFO L225 Difference]: With dead ends: 128 [2025-03-04 11:33:27,899 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 11:33:27,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=84, Invalid=335, Unknown=1, NotChecked=0, Total=420 [2025-03-04 11:33:27,900 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 95 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:27,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 366 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 11:33:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2025-03-04 11:33:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 99 states have internal predecessors, (107), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-04 11:33:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2025-03-04 11:33:27,905 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 31 [2025-03-04 11:33:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:27,905 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2025-03-04 11:33:27,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2025-03-04 11:33:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:33:27,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:27,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:27,913 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:33:28,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:33:28,106 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:28,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1143984946, now seen corresponding path program 1 times [2025-03-04 11:33:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:28,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716097601] [2025-03-04 11:33:28,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:28,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:28,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:33:28,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:33:28,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:28,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:28,264 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:33:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716097601] [2025-03-04 11:33:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716097601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:28,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553460687] [2025-03-04 11:33:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:28,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:28,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:28,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:28,265 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:28,433 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2025-03-04 11:33:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-04 11:33:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:28,434 INFO L225 Difference]: With dead ends: 114 [2025-03-04 11:33:28,434 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 11:33:28,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:28,434 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 18 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:28,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 11:33:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 11:33:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 90 states have internal predecessors, (97), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-04 11:33:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-03-04 11:33:28,440 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 31 [2025-03-04 11:33:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:28,440 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-03-04 11:33:28,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-03-04 11:33:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:33:28,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:28,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:28,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:33:28,441 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_26_to_34_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:28,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash -855769025, now seen corresponding path program 1 times [2025-03-04 11:33:28,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:28,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155636600] [2025-03-04 11:33:28,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:28,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:28,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:33:28,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:33:28,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:28,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155636600] [2025-03-04 11:33:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155636600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859429444] [2025-03-04 11:33:28,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:28,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:28,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:28,681 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:33:28,683 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:33:28,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:33:28,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:33:28,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:28,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:28,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 11:33:28,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:28,759 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:33:28,765 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:33:29,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:29,098 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:33:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:29,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859429444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:33:29,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:33:29,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 31 [2025-03-04 11:33:29,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098134860] [2025-03-04 11:33:29,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:29,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 11:33:29,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:29,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 11:33:29,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:33:29,648 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:33:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:30,988 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2025-03-04 11:33:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 11:33:30,988 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2025-03-04 11:33:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:30,989 INFO L225 Difference]: With dead ends: 119 [2025-03-04 11:33:30,989 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 11:33:30,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=2491, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:33:30,990 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 336 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:30,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 498 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:33:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 11:33:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2025-03-04 11:33:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 89 states have internal predecessors, (95), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:33:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2025-03-04 11:33:30,998 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2025-03-04 11:33:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:30,998 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2025-03-04 11:33:30,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 27 states have internal predecessors, (71), 7 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:33:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2025-03-04 11:33:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:33:30,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:30,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:31,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:31,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:31,200 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_26_to_34_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:31,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:31,200 INFO L85 PathProgramCache]: Analyzing trace with hash -759035976, now seen corresponding path program 1 times [2025-03-04 11:33:31,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:31,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807508738] [2025-03-04 11:33:31,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:31,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:31,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:33:31,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:33:31,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:31,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:31,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:31,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807508738] [2025-03-04 11:33:31,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807508738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:31,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878537084] [2025-03-04 11:33:31,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:31,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:31,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:31,442 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:33:31,444 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:33:31,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:33:31,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:33:31,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:31,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:31,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 11:33:31,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:31,521 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:33:31,525 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:33:31,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:31,689 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:33:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:31,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:31,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878537084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:33:31,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:33:31,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2025-03-04 11:33:31,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443883891] [2025-03-04 11:33:31,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:31,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:33:31,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:31,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:33:31,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:33:31,857 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 21 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:33:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:32,167 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2025-03-04 11:33:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:33:32,167 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-04 11:33:32,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:32,168 INFO L225 Difference]: With dead ends: 117 [2025-03-04 11:33:32,169 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 11:33:32,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:33:32,170 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 115 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:32,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 552 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:32,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 11:33:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2025-03-04 11:33:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 89 states have internal predecessors, (94), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:33:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2025-03-04 11:33:32,182 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 33 [2025-03-04 11:33:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:32,182 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2025-03-04 11:33:32,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:33:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2025-03-04 11:33:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:33:32,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:32,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:32,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:33:32,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:32,387 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_26_to_34_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:32,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:32,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2055278755, now seen corresponding path program 1 times [2025-03-04 11:33:32,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:32,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70195152] [2025-03-04 11:33:32,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:32,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:32,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:33:32,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:33:32,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:32,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1220744444] [2025-03-04 11:33:32,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:32,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:32,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:32,414 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:33:32,416 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:33:32,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:33:32,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:33:32,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:32,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:32,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 11:33:32,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:32,499 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:33:32,502 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:33:32,619 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:33:32,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:32,698 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:33:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:32,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:37,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70195152] [2025-03-04 11:33:37,140 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220744444] [2025-03-04 11:33:37,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220744444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:37,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:33:37,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 11:33:37,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894862053] [2025-03-04 11:33:37,140 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:37,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 11:33:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:37,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 11:33:37,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=286, Unknown=1, NotChecked=0, Total=342 [2025-03-04 11:33:37,142 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:37,409 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2025-03-04 11:33:37,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:33:37,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 11:33:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:37,410 INFO L225 Difference]: With dead ends: 113 [2025-03-04 11:33:37,410 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 11:33:37,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=104, Invalid=447, Unknown=1, NotChecked=0, Total=552 [2025-03-04 11:33:37,411 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 72 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:37,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 353 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 11:33:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2025-03-04 11:33:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 89 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:33:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2025-03-04 11:33:37,422 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 34 [2025-03-04 11:33:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:37,422 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2025-03-04 11:33:37,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2025-03-04 11:33:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:33:37,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:37,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:37,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:33:37,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:37,624 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_26_to_34_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:37,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:37,624 INFO L85 PathProgramCache]: Analyzing trace with hash 710868054, now seen corresponding path program 1 times [2025-03-04 11:33:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411370697] [2025-03-04 11:33:37,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:37,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:37,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:33:37,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:33:37,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:37,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:37,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411370697] [2025-03-04 11:33:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411370697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874201084] [2025-03-04 11:33:37,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:37,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:37,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:37,856 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:33:37,858 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:33:37,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:33:37,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:33:37,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:37,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:37,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 11:33:37,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:37,940 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:33:37,943 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:33:38,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:38,091 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:33:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:38,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:33:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874201084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:33:42,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:33:42,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2025-03-04 11:33:42,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645539102] [2025-03-04 11:33:42,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:33:42,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:33:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:42,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:33:42,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=320, Unknown=2, NotChecked=0, Total=380 [2025-03-04 11:33:42,948 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:33:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:43,186 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2025-03-04 11:33:43,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:33:43,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-04 11:33:43,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:43,187 INFO L225 Difference]: With dead ends: 115 [2025-03-04 11:33:43,187 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 11:33:43,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=100, Invalid=498, Unknown=2, NotChecked=0, Total=600 [2025-03-04 11:33:43,188 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 69 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:43,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 472 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:43,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 11:33:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2025-03-04 11:33:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 89 states have internal predecessors, (92), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 11:33:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2025-03-04 11:33:43,198 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 35 [2025-03-04 11:33:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:43,198 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2025-03-04 11:33:43,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:33:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2025-03-04 11:33:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:33:43,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:43,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:43,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:43,402 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,SelfDestructingSolverStorable22 [2025-03-04 11:33:43,403 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_26_to_34_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-04 11:33:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash 562073211, now seen corresponding path program 1 times [2025-03-04 11:33:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584228526] [2025-03-04 11:33:43,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:43,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:43,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:33:43,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:33:43,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:43,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat