./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:34:13,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:34:13,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:34:13,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:34:13,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:34:13,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:34:13,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:34:13,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:34:13,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:34:13,355 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:34:13,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:34:13,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:34:13,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:34:13,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:34:13,355 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:34:13,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:34:13,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:34:13,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:34:13,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:34:13,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:34:13,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:34:13,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:34:13,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:34:13,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:34:13,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:34:13,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:34:13,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:34:13,358 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e [2025-02-06 14:34:13,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:34:13,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:34:13,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:34:13,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:34:13,610 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:34:13,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2025-02-06 14:34:14,707 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/574e5cdc2/a1763a92a565434bae4bab6a5069fdf6/FLAG2912b16f8 [2025-02-06 14:34:14,925 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:34:14,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2025-02-06 14:34:14,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/574e5cdc2/a1763a92a565434bae4bab6a5069fdf6/FLAG2912b16f8 [2025-02-06 14:34:15,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/574e5cdc2/a1763a92a565434bae4bab6a5069fdf6 [2025-02-06 14:34:15,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:34:15,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:34:15,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:34:15,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:34:15,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:34:15,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1126d907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15, skipping insertion in model container [2025-02-06 14:34:15,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:34:15,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:34:15,433 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:34:15,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:34:15,476 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:34:15,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15 WrapperNode [2025-02-06 14:34:15,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:34:15,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:34:15,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:34:15,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:34:15,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,517 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2025-02-06 14:34:15,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:34:15,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:34:15,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:34:15,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:34:15,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,540 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 11, 5, 12, 21, 15]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 2, 1, 2, 2, 2]. [2025-02-06 14:34:15,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:34:15,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:34:15,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:34:15,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:34:15,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (1/1) ... [2025-02-06 14:34:15,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:34:15,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:15,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:34:15,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:34:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:34:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:34:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:34:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:34:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:34:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:34:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 14:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:34:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 14:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_39_0 [2025-02-06 14:34:15,612 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_39_0 [2025-02-06 14:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:34:15,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:34:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 14:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 14:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 14:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 14:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 14:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 14:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:34:15,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:34:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:34:15,682 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:34:15,683 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:34:16,178 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~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_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#z~0#1.base, main_~#z~0#1.offset);havoc main_~#z~0#1.base, main_~#z~0#1.offset; [2025-02-06 14:34:16,207 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2025-02-06 14:34:16,207 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:34:16,225 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:34:16,225 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:34:16,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:16 BoogieIcfgContainer [2025-02-06 14:34:16,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:34:16,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:34:16,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:34:16,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:34:16,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:34:15" (1/3) ... [2025-02-06 14:34:16,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d16908f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:34:16, skipping insertion in model container [2025-02-06 14:34:16,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:34:15" (2/3) ... [2025-02-06 14:34:16,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d16908f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:34:16, skipping insertion in model container [2025-02-06 14:34:16,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:16" (3/3) ... [2025-02-06 14:34:16,232 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_cohencu.c [2025-02-06 14:34:16,243 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:34:16,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_cohencu.c that has 3 procedures, 317 locations, 1 initial locations, 0 loop locations, and 138 error locations. [2025-02-06 14:34:16,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:34:16,298 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;@1e559955, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:34:16,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-02-06 14:34:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 14:34:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 14:34:16,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:16,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 14:34:16,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:16,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1557033859, now seen corresponding path program 1 times [2025-02-06 14:34:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:16,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568383211] [2025-02-06 14:34:16,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:16,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:16,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 14:34:16,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 14:34:16,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:16,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568383211] [2025-02-06 14:34:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568383211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:16,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:16,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084371869] [2025-02-06 14:34:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:16,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:16,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:16,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:16,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:16,703 INFO L87 Difference]: Start difference. First operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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-02-06 14:34:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:16,902 INFO L93 Difference]: Finished difference Result 738 states and 792 transitions. [2025-02-06 14:34:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:16,904 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-02-06 14:34:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:16,911 INFO L225 Difference]: With dead ends: 738 [2025-02-06 14:34:16,911 INFO L226 Difference]: Without dead ends: 418 [2025-02-06 14:34:16,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:16,916 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 205 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:16,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1530 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-06 14:34:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 371. [2025-02-06 14:34:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8497652582159625) internal successors, (394), 351 states have internal predecessors, (394), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2025-02-06 14:34:16,968 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 6 [2025-02-06 14:34:16,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:16,969 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2025-02-06 14:34:16,969 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-02-06 14:34:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2025-02-06 14:34:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 14:34:16,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:16,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:16,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:34:16,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:16,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 527372962, now seen corresponding path program 1 times [2025-02-06 14:34:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622789918] [2025-02-06 14:34:16,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:16,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 14:34:17,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 14:34:17,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:17,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:17,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:17,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622789918] [2025-02-06 14:34:17,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622789918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:17,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:17,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209677008] [2025-02-06 14:34:17,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:17,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:17,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:17,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:17,184 INFO L87 Difference]: Start difference. First operand 371 states and 429 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:17,322 INFO L93 Difference]: Finished difference Result 418 states and 434 transitions. [2025-02-06 14:34:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (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 16 [2025-02-06 14:34:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:17,323 INFO L225 Difference]: With dead ends: 418 [2025-02-06 14:34:17,323 INFO L226 Difference]: Without dead ends: 414 [2025-02-06 14:34:17,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:17,324 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 200 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:17,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1479 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-06 14:34:17,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 371. [2025-02-06 14:34:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8309859154929577) internal successors, (390), 351 states have internal predecessors, (390), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2025-02-06 14:34:17,346 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 16 [2025-02-06 14:34:17,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:17,346 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2025-02-06 14:34:17,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2025-02-06 14:34:17,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 14:34:17,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:17,347 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] [2025-02-06 14:34:17,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:34:17,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:17,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash -693762722, now seen corresponding path program 1 times [2025-02-06 14:34:17,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:17,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077229136] [2025-02-06 14:34:17,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:17,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 14:34:17,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 14:34:17,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:17,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:17,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:17,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077229136] [2025-02-06 14:34:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077229136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:17,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845702124] [2025-02-06 14:34:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:17,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:17,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:17,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:17,504 INFO L87 Difference]: Start difference. First operand 371 states and 425 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:17,645 INFO L93 Difference]: Finished difference Result 414 states and 430 transitions. [2025-02-06 14:34:17,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:17,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 20 [2025-02-06 14:34:17,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:17,647 INFO L225 Difference]: With dead ends: 414 [2025-02-06 14:34:17,648 INFO L226 Difference]: Without dead ends: 412 [2025-02-06 14:34:17,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:17,649 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 186 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:17,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1481 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:17,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-06 14:34:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 371. [2025-02-06 14:34:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8215962441314555) internal successors, (388), 351 states have internal predecessors, (388), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2025-02-06 14:34:17,663 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 20 [2025-02-06 14:34:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:17,664 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2025-02-06 14:34:17,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:34:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2025-02-06 14:34:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 14:34:17,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:17,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:17,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:34:17,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:17,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -986042692, now seen corresponding path program 1 times [2025-02-06 14:34:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:17,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342780525] [2025-02-06 14:34:17,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:17,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 14:34:17,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 14:34:17,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:17,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:17,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342780525] [2025-02-06 14:34:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342780525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589047937] [2025-02-06 14:34:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:17,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:17,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:17,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:17,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:17,781 INFO L87 Difference]: Start difference. First operand 371 states and 423 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-02-06 14:34:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:17,920 INFO L93 Difference]: Finished difference Result 412 states and 428 transitions. [2025-02-06 14:34:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:17,921 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-02-06 14:34:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:17,922 INFO L225 Difference]: With dead ends: 412 [2025-02-06 14:34:17,922 INFO L226 Difference]: Without dead ends: 410 [2025-02-06 14:34:17,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:34:17,923 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 188 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:17,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1549 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-02-06 14:34:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2025-02-06 14:34:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.812206572769953) internal successors, (386), 351 states have internal predecessors, (386), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 421 transitions. [2025-02-06 14:34:17,938 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 421 transitions. Word has length 22 [2025-02-06 14:34:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:17,938 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 421 transitions. [2025-02-06 14:34:17,938 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-02-06 14:34:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 421 transitions. [2025-02-06 14:34:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 14:34:17,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:17,939 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-02-06 14:34:17,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:34:17,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:17,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash -502552313, now seen corresponding path program 1 times [2025-02-06 14:34:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314814483] [2025-02-06 14:34:17,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:17,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 14:34:17,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 14:34:17,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:17,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:34:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:18,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314814483] [2025-02-06 14:34:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314814483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:18,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:18,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891056546] [2025-02-06 14:34:18,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:18,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:18,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:18,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:18,071 INFO L87 Difference]: Start difference. First operand 371 states and 421 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-02-06 14:34:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:18,188 INFO L93 Difference]: Finished difference Result 410 states and 426 transitions. [2025-02-06 14:34:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:18,188 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-02-06 14:34:18,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:18,190 INFO L225 Difference]: With dead ends: 410 [2025-02-06 14:34:18,190 INFO L226 Difference]: Without dead ends: 408 [2025-02-06 14:34:18,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:18,191 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 175 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:18,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1483 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-06 14:34:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 371. [2025-02-06 14:34:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8028169014084507) internal successors, (384), 351 states have internal predecessors, (384), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-02-06 14:34:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 419 transitions. [2025-02-06 14:34:18,199 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 419 transitions. Word has length 23 [2025-02-06 14:34:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:18,200 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 419 transitions. [2025-02-06 14:34:18,200 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-02-06 14:34:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 419 transitions. [2025-02-06 14:34:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 14:34:18,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:18,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:18,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:34:18,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:18,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1614887917, now seen corresponding path program 1 times [2025-02-06 14:34:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506192529] [2025-02-06 14:34:18,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:18,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:34:18,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:34:18,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:18,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:18,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418340538] [2025-02-06 14:34:18,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:18,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:18,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:18,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:18,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:34:18,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:34:18,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:34:18,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:18,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:18,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 14:34:18,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:18,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:34:18,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:18,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506192529] [2025-02-06 14:34:18,434 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418340538] [2025-02-06 14:34:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418340538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:18,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202691296] [2025-02-06 14:34:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:18,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:18,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:18,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:18,435 INFO L87 Difference]: Start difference. First operand 371 states and 419 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:34:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:18,617 INFO L93 Difference]: Finished difference Result 590 states and 609 transitions. [2025-02-06 14:34:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:18,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-02-06 14:34:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:18,620 INFO L225 Difference]: With dead ends: 590 [2025-02-06 14:34:18,620 INFO L226 Difference]: Without dead ends: 586 [2025-02-06 14:34:18,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:34:18,621 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 344 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:18,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1768 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-06 14:34:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 453. [2025-02-06 14:34:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8131487889273357) internal successors, (524), 427 states have internal predecessors, (524), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2025-02-06 14:34:18,639 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 32 [2025-02-06 14:34:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:18,640 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2025-02-06 14:34:18,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:34:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2025-02-06 14:34:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 14:34:18,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:18,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:18,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:34:18,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:18,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:18,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:18,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1832861348, now seen corresponding path program 1 times [2025-02-06 14:34:18,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:18,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504259435] [2025-02-06 14:34:18,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:18,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:18,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 14:34:18,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 14:34:18,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:18,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313758883] [2025-02-06 14:34:18,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:18,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:18,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:18,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:18,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:34:18,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 14:34:18,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 14:34:18,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:18,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:18,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 14:34:18,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:18,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:18,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:19,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:34:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:34:19,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:19,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504259435] [2025-02-06 14:34:19,545 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313758883] [2025-02-06 14:34:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313758883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:19,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-02-06 14:34:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616220129] [2025-02-06 14:34:19,545 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 14:34:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:19,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 14:34:19,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-06 14:34:19,547 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:34:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:20,234 INFO L93 Difference]: Finished difference Result 594 states and 613 transitions. [2025-02-06 14:34:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 14:34:20,235 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-02-06 14:34:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:20,237 INFO L225 Difference]: With dead ends: 594 [2025-02-06 14:34:20,237 INFO L226 Difference]: Without dead ends: 593 [2025-02-06 14:34:20,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-02-06 14:34:20,238 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 449 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:20,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 2866 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 14:34:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-06 14:34:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 453. [2025-02-06 14:34:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8096885813148789) internal successors, (523), 427 states have internal predecessors, (523), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 568 transitions. [2025-02-06 14:34:20,252 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 568 transitions. Word has length 42 [2025-02-06 14:34:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:20,252 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 568 transitions. [2025-02-06 14:34:20,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:34:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 568 transitions. [2025-02-06 14:34:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 14:34:20,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:20,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:20,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:20,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:20,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:20,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash 984126987, now seen corresponding path program 1 times [2025-02-06 14:34:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:20,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393165441] [2025-02-06 14:34:20,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:20,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:34:20,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:34:20,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:20,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:20,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392814624] [2025-02-06 14:34:20,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:20,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:20,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:20,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:20,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:34:20,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:34:20,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:34:20,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:20,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:20,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 14:34:20,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:20,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:20,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:20,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:20,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393165441] [2025-02-06 14:34:20,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392814624] [2025-02-06 14:34:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392814624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720072505] [2025-02-06 14:34:20,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:20,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:20,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:20,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:20,780 INFO L87 Difference]: Start difference. First operand 453 states and 568 transitions. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:21,011 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2025-02-06 14:34:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:21,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-06 14:34:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:21,014 INFO L225 Difference]: With dead ends: 593 [2025-02-06 14:34:21,014 INFO L226 Difference]: Without dead ends: 592 [2025-02-06 14:34:21,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:34:21,014 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 516 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:21,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1338 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-06 14:34:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 453. [2025-02-06 14:34:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.806228373702422) internal successors, (522), 427 states have internal predecessors, (522), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 567 transitions. [2025-02-06 14:34:21,026 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 567 transitions. Word has length 43 [2025-02-06 14:34:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:21,026 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 567 transitions. [2025-02-06 14:34:21,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 567 transitions. [2025-02-06 14:34:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 14:34:21,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:21,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:21,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 14:34:21,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:21,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:21,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash 443165570, now seen corresponding path program 1 times [2025-02-06 14:34:21,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:21,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763892226] [2025-02-06 14:34:21,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:21,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:21,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 14:34:21,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 14:34:21,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:21,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:21,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:21,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763892226] [2025-02-06 14:34:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763892226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:21,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:21,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789997886] [2025-02-06 14:34:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:21,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:21,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:21,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:21,362 INFO L87 Difference]: Start difference. First operand 453 states and 567 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:21,494 INFO L93 Difference]: Finished difference Result 560 states and 580 transitions. [2025-02-06 14:34:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:21,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-02-06 14:34:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:21,496 INFO L225 Difference]: With dead ends: 560 [2025-02-06 14:34:21,496 INFO L226 Difference]: Without dead ends: 558 [2025-02-06 14:34:21,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:21,497 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 313 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:21,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1431 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-02-06 14:34:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 453. [2025-02-06 14:34:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7993079584775087) internal successors, (520), 427 states have internal predecessors, (520), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 565 transitions. [2025-02-06 14:34:21,510 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 565 transitions. Word has length 44 [2025-02-06 14:34:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:21,510 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 565 transitions. [2025-02-06 14:34:21,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 565 transitions. [2025-02-06 14:34:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 14:34:21,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:21,511 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:21,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:34:21,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:21,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash 680351840, now seen corresponding path program 1 times [2025-02-06 14:34:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:21,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688801688] [2025-02-06 14:34:21,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:21,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 14:34:21,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 14:34:21,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:21,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:21,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:21,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688801688] [2025-02-06 14:34:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688801688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:21,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:21,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399493205] [2025-02-06 14:34:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:21,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:21,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:21,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:21,641 INFO L87 Difference]: Start difference. First operand 453 states and 565 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:21,850 INFO L93 Difference]: Finished difference Result 558 states and 578 transitions. [2025-02-06 14:34:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-02-06 14:34:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:21,853 INFO L225 Difference]: With dead ends: 558 [2025-02-06 14:34:21,853 INFO L226 Difference]: Without dead ends: 557 [2025-02-06 14:34:21,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:34:21,854 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 309 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:21,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1695 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-06 14:34:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 453. [2025-02-06 14:34:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7958477508650519) internal successors, (519), 427 states have internal predecessors, (519), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 564 transitions. [2025-02-06 14:34:21,870 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 564 transitions. Word has length 46 [2025-02-06 14:34:21,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:21,870 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 564 transitions. [2025-02-06 14:34:21,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 564 transitions. [2025-02-06 14:34:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 14:34:21,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:21,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:34:21,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:21,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash -383929401, now seen corresponding path program 1 times [2025-02-06 14:34:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876960247] [2025-02-06 14:34:21,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:21,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 14:34:21,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 14:34:21,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:21,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:22,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876960247] [2025-02-06 14:34:22,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876960247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:22,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:22,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469891634] [2025-02-06 14:34:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:22,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:22,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:22,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:22,038 INFO L87 Difference]: Start difference. First operand 453 states and 564 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:22,237 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2025-02-06 14:34:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:22,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-02-06 14:34:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:22,240 INFO L225 Difference]: With dead ends: 557 [2025-02-06 14:34:22,240 INFO L226 Difference]: Without dead ends: 556 [2025-02-06 14:34:22,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:22,241 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 306 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:22,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-06 14:34:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2025-02-06 14:34:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.792387543252595) internal successors, (518), 427 states have internal predecessors, (518), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 563 transitions. [2025-02-06 14:34:22,253 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 563 transitions. Word has length 47 [2025-02-06 14:34:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:22,253 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 563 transitions. [2025-02-06 14:34:22,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 563 transitions. [2025-02-06 14:34:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 14:34:22,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:22,254 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:22,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:34:22,254 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:22,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash 983090494, now seen corresponding path program 1 times [2025-02-06 14:34:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029401457] [2025-02-06 14:34:22,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:22,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 14:34:22,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 14:34:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029401457] [2025-02-06 14:34:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029401457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:22,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686576902] [2025-02-06 14:34:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:22,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:22,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:22,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:22,380 INFO L87 Difference]: Start difference. First operand 453 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:22,537 INFO L93 Difference]: Finished difference Result 568 states and 588 transitions. [2025-02-06 14:34:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:22,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-06 14:34:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:22,540 INFO L225 Difference]: With dead ends: 568 [2025-02-06 14:34:22,540 INFO L226 Difference]: Without dead ends: 566 [2025-02-06 14:34:22,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:22,541 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 311 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:22,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1423 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-06 14:34:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2025-02-06 14:34:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7854671280276817) internal successors, (516), 427 states have internal predecessors, (516), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 561 transitions. [2025-02-06 14:34:22,552 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 561 transitions. Word has length 48 [2025-02-06 14:34:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:22,552 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 561 transitions. [2025-02-06 14:34:22,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 561 transitions. [2025-02-06 14:34:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 14:34:22,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:22,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:22,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:34:22,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:22,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:22,554 INFO L85 PathProgramCache]: Analyzing trace with hash -142839268, now seen corresponding path program 1 times [2025-02-06 14:34:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:22,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316660102] [2025-02-06 14:34:22,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:22,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:22,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 14:34:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 14:34:22,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:22,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:22,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177489128] [2025-02-06 14:34:22,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:22,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:22,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:22,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:34:22,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 14:34:22,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 14:34:22,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:22,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:22,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 14:34:22,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:22,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:22,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:22,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:34:23,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:23,605 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 46 treesize of output 38 [2025-02-06 14:34:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:34:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316660102] [2025-02-06 14:34:23,687 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177489128] [2025-02-06 14:34:23,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177489128] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:23,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:34:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2025-02-06 14:34:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304673464] [2025-02-06 14:34:23,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:23,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:34:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:23,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:34:23,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:34:23,689 INFO L87 Difference]: Start difference. First operand 453 states and 561 transitions. Second operand has 24 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 14:34:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:25,534 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2025-02-06 14:34:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 14:34:25,534 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2025-02-06 14:34:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:25,536 INFO L225 Difference]: With dead ends: 582 [2025-02-06 14:34:25,536 INFO L226 Difference]: Without dead ends: 580 [2025-02-06 14:34:25,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 14:34:25,537 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 941 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 3700 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:25,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 3700 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 14:34:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-06 14:34:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 453. [2025-02-06 14:34:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.778546712802768) internal successors, (514), 427 states have internal predecessors, (514), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 559 transitions. [2025-02-06 14:34:25,552 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 559 transitions. Word has length 50 [2025-02-06 14:34:25,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:25,552 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 559 transitions. [2025-02-06 14:34:25,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.761904761904762) internal successors, (79), 21 states have internal predecessors, (79), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 14:34:25,553 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 559 transitions. [2025-02-06 14:34:25,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 14:34:25,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:25,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:25,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:34:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 14:34:25,753 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 170417914, now seen corresponding path program 1 times [2025-02-06 14:34:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556251057] [2025-02-06 14:34:25,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:25,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 14:34:25,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 14:34:25,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:25,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556251057] [2025-02-06 14:34:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556251057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:25,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:25,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:25,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319274590] [2025-02-06 14:34:25,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:25,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:25,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:25,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:25,876 INFO L87 Difference]: Start difference. First operand 453 states and 559 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:26,018 INFO L93 Difference]: Finished difference Result 576 states and 596 transitions. [2025-02-06 14:34:26,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:26,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-02-06 14:34:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:26,020 INFO L225 Difference]: With dead ends: 576 [2025-02-06 14:34:26,020 INFO L226 Difference]: Without dead ends: 574 [2025-02-06 14:34:26,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:26,021 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 309 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:26,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-02-06 14:34:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 453. [2025-02-06 14:34:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7716262975778547) internal successors, (512), 427 states have internal predecessors, (512), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 557 transitions. [2025-02-06 14:34:26,034 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 557 transitions. Word has length 52 [2025-02-06 14:34:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:26,034 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 557 transitions. [2025-02-06 14:34:26,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 557 transitions. [2025-02-06 14:34:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 14:34:26,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:26,035 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:26,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:34:26,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:26,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 562858968, now seen corresponding path program 1 times [2025-02-06 14:34:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495425243] [2025-02-06 14:34:26,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:26,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 14:34:26,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 14:34:26,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:26,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:26,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:26,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495425243] [2025-02-06 14:34:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495425243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:26,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:26,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484968208] [2025-02-06 14:34:26,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:26,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:26,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:26,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:26,167 INFO L87 Difference]: Start difference. First operand 453 states and 557 transitions. Second operand has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:26,359 INFO L93 Difference]: Finished difference Result 574 states and 594 transitions. [2025-02-06 14:34:26,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:26,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-02-06 14:34:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:26,361 INFO L225 Difference]: With dead ends: 574 [2025-02-06 14:34:26,361 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 14:34:26,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:34:26,362 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 310 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:26,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1461 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 14:34:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2025-02-06 14:34:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7647058823529411) internal successors, (510), 427 states have internal predecessors, (510), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 555 transitions. [2025-02-06 14:34:26,376 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 555 transitions. Word has length 54 [2025-02-06 14:34:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:26,376 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 555 transitions. [2025-02-06 14:34:26,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 555 transitions. [2025-02-06 14:34:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 14:34:26,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:26,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:26,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:34:26,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:26,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:26,377 INFO L85 PathProgramCache]: Analyzing trace with hash 268758847, now seen corresponding path program 1 times [2025-02-06 14:34:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:26,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587033807] [2025-02-06 14:34:26,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:26,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 14:34:26,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 14:34:26,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:26,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:26,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:26,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587033807] [2025-02-06 14:34:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587033807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:34:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101955193] [2025-02-06 14:34:26,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:26,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:34:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:26,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:34:26,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:26,704 INFO L87 Difference]: Start difference. First operand 453 states and 555 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:27,241 INFO L93 Difference]: Finished difference Result 548 states and 568 transitions. [2025-02-06 14:34:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:34:27,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-02-06 14:34:27,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:27,243 INFO L225 Difference]: With dead ends: 548 [2025-02-06 14:34:27,243 INFO L226 Difference]: Without dead ends: 546 [2025-02-06 14:34:27,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:34:27,244 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 292 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:27,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1797 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 14:34:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-02-06 14:34:27,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 453. [2025-02-06 14:34:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7577854671280277) internal successors, (508), 427 states have internal predecessors, (508), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 553 transitions. [2025-02-06 14:34:27,254 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 553 transitions. Word has length 55 [2025-02-06 14:34:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:27,254 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 553 transitions. [2025-02-06 14:34:27,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:34:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 553 transitions. [2025-02-06 14:34:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 14:34:27,254 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:27,254 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:27,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:34:27,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:27,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:27,255 INFO L85 PathProgramCache]: Analyzing trace with hash 894937261, now seen corresponding path program 1 times [2025-02-06 14:34:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:27,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933518280] [2025-02-06 14:34:27,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:27,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 14:34:27,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 14:34:27,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:27,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:27,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435258513] [2025-02-06 14:34:27,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:27,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:27,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:27,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:27,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:34:27,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 14:34:27,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 14:34:27,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:27,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:27,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 14:34:27,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:27,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:27,368 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 7 treesize of output 3 [2025-02-06 14:34:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:34:27,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:27,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933518280] [2025-02-06 14:34:27,564 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435258513] [2025-02-06 14:34:27,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435258513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:27,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:34:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-02-06 14:34:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106229741] [2025-02-06 14:34:27,564 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:27,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 14:34:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:27,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 14:34:27,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:34:27,565 INFO L87 Difference]: Start difference. First operand 453 states and 553 transitions. Second operand has 10 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:34:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:27,888 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2025-02-06 14:34:27,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:34:27,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2025-02-06 14:34:27,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:27,890 INFO L225 Difference]: With dead ends: 582 [2025-02-06 14:34:27,890 INFO L226 Difference]: Without dead ends: 581 [2025-02-06 14:34:27,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:34:27,891 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 314 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:27,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 2468 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:34:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-02-06 14:34:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 453. [2025-02-06 14:34:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.754325259515571) internal successors, (507), 427 states have internal predecessors, (507), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 552 transitions. [2025-02-06 14:34:27,901 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 552 transitions. Word has length 64 [2025-02-06 14:34:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:27,902 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 552 transitions. [2025-02-06 14:34:27,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 14:34:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 552 transitions. [2025-02-06 14:34:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 14:34:27,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:27,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:27,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:28,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 14:34:28,107 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:28,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1973251328, now seen corresponding path program 1 times [2025-02-06 14:34:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:28,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885173921] [2025-02-06 14:34:28,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:28,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 14:34:28,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 14:34:28,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:28,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460777593] [2025-02-06 14:34:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:28,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:28,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:28,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:28,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:34:28,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 14:34:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 14:34:28,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:28,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:28,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 14:34:28,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:28,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:34:28,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:34:28,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885173921] [2025-02-06 14:34:28,369 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:28,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460777593] [2025-02-06 14:34:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460777593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:28,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:28,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:34:28,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322312831] [2025-02-06 14:34:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:28,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:34:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:28,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:34:28,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:34:28,371 INFO L87 Difference]: Start difference. First operand 453 states and 552 transitions. Second operand has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 14:34:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:28,519 INFO L93 Difference]: Finished difference Result 581 states and 600 transitions. [2025-02-06 14:34:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:34:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2025-02-06 14:34:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:28,525 INFO L225 Difference]: With dead ends: 581 [2025-02-06 14:34:28,525 INFO L226 Difference]: Without dead ends: 580 [2025-02-06 14:34:28,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:34:28,526 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 311 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:28,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1570 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-06 14:34:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 453. [2025-02-06 14:34:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7508650519031141) internal successors, (506), 427 states have internal predecessors, (506), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 551 transitions. [2025-02-06 14:34:28,536 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 551 transitions. Word has length 65 [2025-02-06 14:34:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:28,536 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 551 transitions. [2025-02-06 14:34:28,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 14:34:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 551 transitions. [2025-02-06 14:34:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 14:34:28,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:28,537 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:28,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:28,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 14:34:28,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_27_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1041249035, now seen corresponding path program 1 times [2025-02-06 14:34:28,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:28,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764160494] [2025-02-06 14:34:28,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:28,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 14:34:28,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 14:34:28,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:28,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:34:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764160494] [2025-02-06 14:34:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764160494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:28,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4419152] [2025-02-06 14:34:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:28,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:28,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:28,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:28,857 INFO L87 Difference]: Start difference. First operand 453 states and 551 transitions. Second operand has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 14:34:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:29,001 INFO L93 Difference]: Finished difference Result 556 states and 576 transitions. [2025-02-06 14:34:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2025-02-06 14:34:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:29,003 INFO L225 Difference]: With dead ends: 556 [2025-02-06 14:34:29,003 INFO L226 Difference]: Without dead ends: 554 [2025-02-06 14:34:29,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:29,003 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 274 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:29,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1423 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-06 14:34:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 453. [2025-02-06 14:34:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7439446366782008) internal successors, (504), 427 states have internal predecessors, (504), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 549 transitions. [2025-02-06 14:34:29,012 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 549 transitions. Word has length 66 [2025-02-06 14:34:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 549 transitions. [2025-02-06 14:34:29,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 14:34:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 549 transitions. [2025-02-06 14:34:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 14:34:29,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:29,013 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:29,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 14:34:29,013 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_27_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:29,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash -87057047, now seen corresponding path program 1 times [2025-02-06 14:34:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774638474] [2025-02-06 14:34:29,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:29,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 14:34:29,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 14:34:29,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:29,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048195950] [2025-02-06 14:34:29,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:29,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:29,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:29,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:29,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 14:34:29,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 14:34:29,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 14:34:29,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:29,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:29,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 14:34:29,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:29,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:29,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:29,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:29,787 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 38 treesize of output 26 [2025-02-06 14:34:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:34:29,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774638474] [2025-02-06 14:34:29,843 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048195950] [2025-02-06 14:34:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048195950] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:29,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:34:29,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2025-02-06 14:34:29,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926386355] [2025-02-06 14:34:29,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:29,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 14:34:29,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:29,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 14:34:29,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-02-06 14:34:29,844 INFO L87 Difference]: Start difference. First operand 453 states and 549 transitions. Second operand has 22 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:34:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:30,773 INFO L93 Difference]: Finished difference Result 574 states and 593 transitions. [2025-02-06 14:34:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 14:34:30,774 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) Word has length 68 [2025-02-06 14:34:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:30,775 INFO L225 Difference]: With dead ends: 574 [2025-02-06 14:34:30,775 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 14:34:30,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 14:34:30,776 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 800 mSDsluCounter, 3276 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:30,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 3533 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 14:34:30,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 14:34:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2025-02-06 14:34:30,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7370242214532872) internal successors, (502), 427 states have internal predecessors, (502), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 547 transitions. [2025-02-06 14:34:30,789 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 547 transitions. Word has length 68 [2025-02-06 14:34:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:30,789 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 547 transitions. [2025-02-06 14:34:30,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:34:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 547 transitions. [2025-02-06 14:34:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 14:34:30,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:30,790 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:30,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:30,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:30,995 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_27_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:30,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2057443385, now seen corresponding path program 1 times [2025-02-06 14:34:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321528548] [2025-02-06 14:34:30,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:31,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 14:34:31,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 14:34:31,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:31,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:34:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321528548] [2025-02-06 14:34:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321528548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200582080] [2025-02-06 14:34:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:31,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:31,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:31,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:31,091 INFO L87 Difference]: Start difference. First operand 453 states and 547 transitions. Second operand has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 14:34:31,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:31,237 INFO L93 Difference]: Finished difference Result 564 states and 584 transitions. [2025-02-06 14:34:31,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:31,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2025-02-06 14:34:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:31,239 INFO L225 Difference]: With dead ends: 564 [2025-02-06 14:34:31,239 INFO L226 Difference]: Without dead ends: 562 [2025-02-06 14:34:31,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:31,240 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 272 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:31,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1415 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-02-06 14:34:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 453. [2025-02-06 14:34:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7301038062283738) internal successors, (500), 427 states have internal predecessors, (500), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 545 transitions. [2025-02-06 14:34:31,250 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 545 transitions. Word has length 70 [2025-02-06 14:34:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:31,250 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 545 transitions. [2025-02-06 14:34:31,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 14:34:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 545 transitions. [2025-02-06 14:34:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 14:34:31,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:31,251 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:31,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 14:34:31,251 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:31,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1518136795, now seen corresponding path program 1 times [2025-02-06 14:34:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:31,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58736469] [2025-02-06 14:34:31,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:31,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 14:34:31,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 14:34:31,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:31,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:31,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793350914] [2025-02-06 14:34:31,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:31,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:31,270 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:31,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 14:34:31,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 14:34:31,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 14:34:31,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:31,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:31,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 14:34:31,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:31,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:31,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 14:34:31,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:32,077 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 46 treesize of output 30 [2025-02-06 14:34:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:34:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58736469] [2025-02-06 14:34:32,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:34:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793350914] [2025-02-06 14:34:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793350914] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:32,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 14:34:32,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2025-02-06 14:34:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162764980] [2025-02-06 14:34:32,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:32,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:34:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:32,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:34:32,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:34:32,133 INFO L87 Difference]: Start difference. First operand 453 states and 545 transitions. Second operand has 24 states, 21 states have (on average 5.380952380952381) internal successors, (113), 21 states have internal predecessors, (113), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:34:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:33,084 INFO L93 Difference]: Finished difference Result 571 states and 591 transitions. [2025-02-06 14:34:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 14:34:33,087 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.380952380952381) internal successors, (113), 21 states have internal predecessors, (113), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) Word has length 72 [2025-02-06 14:34:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:33,088 INFO L225 Difference]: With dead ends: 571 [2025-02-06 14:34:33,088 INFO L226 Difference]: Without dead ends: 567 [2025-02-06 14:34:33,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 116 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 14:34:33,090 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 530 mSDsluCounter, 4054 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 4311 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:33,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 4311 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 14:34:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-06 14:34:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 452. [2025-02-06 14:34:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 289 states have (on average 1.71280276816609) internal successors, (495), 426 states have internal predecessors, (495), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 540 transitions. [2025-02-06 14:34:33,101 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 540 transitions. Word has length 72 [2025-02-06 14:34:33,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:33,101 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 540 transitions. [2025-02-06 14:34:33,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.380952380952381) internal successors, (113), 21 states have internal predecessors, (113), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 14:34:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 540 transitions. [2025-02-06 14:34:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 14:34:33,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:33,102 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:33,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 14:34:33,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:33,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_27_to_39_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:33,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2071941760, now seen corresponding path program 1 times [2025-02-06 14:34:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:33,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959507219] [2025-02-06 14:34:33,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:33,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 14:34:33,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 14:34:33,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:33,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959507219] [2025-02-06 14:34:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959507219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:33,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495535210] [2025-02-06 14:34:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:33,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:33,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:33,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:33,409 INFO L87 Difference]: Start difference. First operand 452 states and 540 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:34:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:33,494 INFO L93 Difference]: Finished difference Result 456 states and 544 transitions. [2025-02-06 14:34:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:33,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 83 [2025-02-06 14:34:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:33,496 INFO L225 Difference]: With dead ends: 456 [2025-02-06 14:34:33,496 INFO L226 Difference]: Without dead ends: 454 [2025-02-06 14:34:33,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:33,497 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 62 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:33,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1503 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-06 14:34:33,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-02-06 14:34:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 291 states have (on average 1.7079037800687284) internal successors, (497), 428 states have internal predecessors, (497), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 542 transitions. [2025-02-06 14:34:33,508 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 542 transitions. Word has length 83 [2025-02-06 14:34:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:33,508 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 542 transitions. [2025-02-06 14:34:33,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:34:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 542 transitions. [2025-02-06 14:34:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-06 14:34:33,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:33,510 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:33,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 14:34:33,510 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_27_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:33,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:33,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1728794530, now seen corresponding path program 1 times [2025-02-06 14:34:33,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:33,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643861847] [2025-02-06 14:34:33,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:33,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:33,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 14:34:33,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 14:34:33,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:33,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643861847] [2025-02-06 14:34:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643861847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740025192] [2025-02-06 14:34:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:33,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:33,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:33,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:33,696 INFO L87 Difference]: Start difference. First operand 454 states and 542 transitions. Second operand has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:34:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:33,846 INFO L93 Difference]: Finished difference Result 531 states and 551 transitions. [2025-02-06 14:34:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:33,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-02-06 14:34:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:33,848 INFO L225 Difference]: With dead ends: 531 [2025-02-06 14:34:33,848 INFO L226 Difference]: Without dead ends: 529 [2025-02-06 14:34:33,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:33,848 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 209 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:33,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1422 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-06 14:34:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 456. [2025-02-06 14:34:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 293 states have (on average 1.7030716723549488) internal successors, (499), 430 states have internal predecessors, (499), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-02-06 14:34:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 544 transitions. [2025-02-06 14:34:33,859 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 544 transitions. Word has length 85 [2025-02-06 14:34:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:33,860 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 544 transitions. [2025-02-06 14:34:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:34:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 544 transitions. [2025-02-06 14:34:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 14:34:33,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:33,861 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:33,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 14:34:33,861 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:33,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2051233559, now seen corresponding path program 1 times [2025-02-06 14:34:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:33,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962502232] [2025-02-06 14:34:33,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:33,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 14:34:33,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 14:34:33,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:33,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:33,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:33,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962502232] [2025-02-06 14:34:33,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962502232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:33,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:33,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:34:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796074629] [2025-02-06 14:34:33,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:33,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:34:33,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:33,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:34:33,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:34:33,954 INFO L87 Difference]: Start difference. First operand 456 states and 544 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 14:34:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:34,051 INFO L93 Difference]: Finished difference Result 462 states and 546 transitions. [2025-02-06 14:34:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:34:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2025-02-06 14:34:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:34,052 INFO L225 Difference]: With dead ends: 462 [2025-02-06 14:34:34,052 INFO L226 Difference]: Without dead ends: 458 [2025-02-06 14:34:34,052 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-02-06 14:34:34,053 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 56 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:34,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1046 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-02-06 14:34:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2025-02-06 14:34:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 294 states have (on average 1.6870748299319729) internal successors, (496), 431 states have internal predecessors, (496), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-02-06 14:34:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 542 transitions. [2025-02-06 14:34:34,068 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 542 transitions. Word has length 86 [2025-02-06 14:34:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:34,068 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 542 transitions. [2025-02-06 14:34:34,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 14:34:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 542 transitions. [2025-02-06 14:34:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 14:34:34,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:34,069 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:34,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 14:34:34,069 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_27_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:34,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash 780799548, now seen corresponding path program 1 times [2025-02-06 14:34:34,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:34,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91616149] [2025-02-06 14:34:34,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:34,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 14:34:34,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 14:34:34,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:34,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91616149] [2025-02-06 14:34:34,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91616149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:34,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:34,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:34,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14905131] [2025-02-06 14:34:34,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:34,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:34,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:34,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:34,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:34,260 INFO L87 Difference]: Start difference. First operand 458 states and 542 transitions. Second operand has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:34:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:34,418 INFO L93 Difference]: Finished difference Result 539 states and 559 transitions. [2025-02-06 14:34:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:34,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2025-02-06 14:34:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:34,420 INFO L225 Difference]: With dead ends: 539 [2025-02-06 14:34:34,420 INFO L226 Difference]: Without dead ends: 537 [2025-02-06 14:34:34,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:34,420 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 215 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:34,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1392 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-06 14:34:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 460. [2025-02-06 14:34:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 296 states have (on average 1.6824324324324325) internal successors, (498), 433 states have internal predecessors, (498), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-02-06 14:34:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 544 transitions. [2025-02-06 14:34:34,432 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 544 transitions. Word has length 87 [2025-02-06 14:34:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:34,432 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 544 transitions. [2025-02-06 14:34:34,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:34:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 544 transitions. [2025-02-06 14:34:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 14:34:34,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:34,433 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:34,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 14:34:34,433 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:34,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1270911974, now seen corresponding path program 1 times [2025-02-06 14:34:34,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:34,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830405779] [2025-02-06 14:34:34,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:34,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 14:34:34,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 14:34:34,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:34,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:34,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830405779] [2025-02-06 14:34:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830405779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:34:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:34:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:34:34,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316334947] [2025-02-06 14:34:34,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:34:34,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:34:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:34,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:34:34,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:34:34,548 INFO L87 Difference]: Start difference. First operand 460 states and 544 transitions. Second operand has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:34:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:34,677 INFO L93 Difference]: Finished difference Result 549 states and 569 transitions. [2025-02-06 14:34:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:34:34,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 89 [2025-02-06 14:34:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:34,679 INFO L225 Difference]: With dead ends: 549 [2025-02-06 14:34:34,679 INFO L226 Difference]: Without dead ends: 547 [2025-02-06 14:34:34,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:34:34,680 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 225 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:34,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1438 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:34:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-06 14:34:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 462. [2025-02-06 14:34:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 298 states have (on average 1.6778523489932886) internal successors, (500), 435 states have internal predecessors, (500), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-02-06 14:34:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 546 transitions. [2025-02-06 14:34:34,692 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 546 transitions. Word has length 89 [2025-02-06 14:34:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:34,692 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 546 transitions. [2025-02-06 14:34:34,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 14:34:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 546 transitions. [2025-02-06 14:34:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 14:34:34,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:34,693 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:34,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 14:34:34,693 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:34,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1848696125, now seen corresponding path program 1 times [2025-02-06 14:34:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:34,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901287599] [2025-02-06 14:34:34,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:34,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:34,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 14:34:34,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 14:34:34,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:34,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:34,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:34,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901287599] [2025-02-06 14:34:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901287599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:34,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873175963] [2025-02-06 14:34:34,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:34,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:34,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:34,980 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:34,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 14:34:35,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 14:34:35,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 14:34:35,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:35,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:35,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 14:34:35,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:35,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:35,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 14:34:35,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:34:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:35,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873175963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:35,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:35,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 17 [2025-02-06 14:34:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872397998] [2025-02-06 14:34:35,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:35,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 14:34:35,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:35,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 14:34:35,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-02-06 14:34:35,435 INFO L87 Difference]: Start difference. First operand 462 states and 546 transitions. Second operand has 18 states, 16 states have (on average 9.0) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 14:34:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:35,759 INFO L93 Difference]: Finished difference Result 671 states and 701 transitions. [2025-02-06 14:34:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 14:34:35,760 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.0) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-02-06 14:34:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:35,762 INFO L225 Difference]: With dead ends: 671 [2025-02-06 14:34:35,762 INFO L226 Difference]: Without dead ends: 668 [2025-02-06 14:34:35,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-02-06 14:34:35,763 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 949 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 2772 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:35,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 2772 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:34:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-06 14:34:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 525. [2025-02-06 14:34:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 355 states have (on average 1.684507042253521) internal successors, (598), 490 states have internal predecessors, (598), 28 states have call successors, (28), 5 states have call predecessors, (28), 8 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2025-02-06 14:34:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 660 transitions. [2025-02-06 14:34:35,776 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 660 transitions. Word has length 94 [2025-02-06 14:34:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:35,776 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 660 transitions. [2025-02-06 14:34:35,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.0) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 14:34:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 660 transitions. [2025-02-06 14:34:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 14:34:35,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:35,777 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:35,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:35,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:35,981 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting func_to_recursive_line_27_to_39_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:35,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1475004938, now seen corresponding path program 1 times [2025-02-06 14:34:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:35,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495169341] [2025-02-06 14:34:35,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:35,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 14:34:35,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 14:34:35,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:35,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 14:34:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:34:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495169341] [2025-02-06 14:34:36,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495169341] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:34:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247477119] [2025-02-06 14:34:36,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:36,203 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:36,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 14:34:36,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 14:34:36,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 14:34:36,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:36,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:34:36,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 14:34:36,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:34:36,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 14:34:36,343 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 7 treesize of output 3 [2025-02-06 14:34:36,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-02-06 14:34:36,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:34:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 14:34:36,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:34:36,864 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 23 treesize of output 15 [2025-02-06 14:34:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 14:34:36,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247477119] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:34:36,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:34:36,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 28 [2025-02-06 14:34:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904629619] [2025-02-06 14:34:36,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:34:36,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 14:34:36,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:34:36,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 14:34:36,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-02-06 14:34:36,908 INFO L87 Difference]: Start difference. First operand 525 states and 660 transitions. Second operand has 29 states, 25 states have (on average 8.16) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 14:34:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:34:37,720 INFO L93 Difference]: Finished difference Result 666 states and 695 transitions. [2025-02-06 14:34:37,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 14:34:37,720 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 8.16) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 95 [2025-02-06 14:34:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:34:37,722 INFO L225 Difference]: With dead ends: 666 [2025-02-06 14:34:37,722 INFO L226 Difference]: Without dead ends: 663 [2025-02-06 14:34:37,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 163 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=368, Invalid=2082, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 14:34:37,723 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1808 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 14:34:37,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 3657 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 14:34:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-02-06 14:34:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 523. [2025-02-06 14:34:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 355 states have (on average 1.6732394366197183) internal successors, (594), 488 states have internal predecessors, (594), 28 states have call successors, (28), 5 states have call predecessors, (28), 8 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2025-02-06 14:34:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 656 transitions. [2025-02-06 14:34:37,735 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 656 transitions. Word has length 95 [2025-02-06 14:34:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:34:37,735 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 656 transitions. [2025-02-06 14:34:37,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 8.16) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 14:34:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 656 transitions. [2025-02-06 14:34:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 14:34:37,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:34:37,736 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:34:37,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 14:34:37,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 14:34:37,940 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-02-06 14:34:37,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:34:37,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1055377989, now seen corresponding path program 1 times [2025-02-06 14:34:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:34:37,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096738609] [2025-02-06 14:34:37,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:34:37,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:34:37,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:34:37,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:37,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:34:37,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985667958] [2025-02-06 14:34:37,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:34:37,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:37,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:34:37,961 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:34:37,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 14:34:38,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:34:38,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:34:38,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:38,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 14:34:38,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 14:34:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 14:34:38,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 14:34:38,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:34:38,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 14:34:38,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 14:34:38,122 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 14:34:38,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 138 remaining) [2025-02-06 14:34:38,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err32ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err36ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err37ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err38ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err40ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err41ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err44ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err46ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err47ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err48ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err50ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err51ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err52ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_27_to_39_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 138 remaining) [2025-02-06 14:34:38,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 138 remaining) [2025-02-06 14:34:38,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 138 remaining) [2025-02-06 14:34:38,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 138 remaining) [2025-02-06 14:34:38,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 138 remaining) [2025-02-06 14:34:38,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 138 remaining) [2025-02-06 14:34:38,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 138 remaining) [2025-02-06 14:34:38,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 138 remaining) [2025-02-06 14:34:38,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 138 remaining) [2025-02-06 14:34:38,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 138 remaining) [2025-02-06 14:34:38,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 138 remaining) [2025-02-06 14:34:38,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 138 remaining) [2025-02-06 14:34:38,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 138 remaining) [2025-02-06 14:34:38,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 14:34:38,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:34:38,332 INFO L422 BasicCegarLoop]: Path program 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-02-06 14:34:38,393 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:34:38,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:34:38 BoogieIcfgContainer [2025-02-06 14:34:38,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:34:38,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:34:38,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:34:38,401 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:34:38,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:34:16" (3/4) ... [2025-02-06 14:34:38,403 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 14:34:38,460 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 23. [2025-02-06 14:34:38,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:34:38,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:34:38,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:34:38,504 INFO L158 Benchmark]: Toolchain (without parser) took 23223.91ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 114.2MB in the beginning and 193.3MB in the end (delta: -79.1MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2025-02-06 14:34:38,504 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:34:38,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.30ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:34:38,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.73ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:34:38,504 INFO L158 Benchmark]: Boogie Preprocessor took 27.79ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:34:38,504 INFO L158 Benchmark]: IcfgBuilder took 676.20ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 50.8MB in the end (delta: 46.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 14:34:38,505 INFO L158 Benchmark]: TraceAbstraction took 22172.13ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 50.3MB in the beginning and 202.9MB in the end (delta: -152.6MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2025-02-06 14:34:38,505 INFO L158 Benchmark]: Witness Printer took 102.99ms. Allocated memory is still 327.2MB. Free memory was 202.9MB in the beginning and 193.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:34:38,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.30ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.5MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.73ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.79ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 676.20ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 50.8MB in the end (delta: 46.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22172.13ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 50.3MB in the beginning and 202.9MB in the end (delta: -152.6MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Witness Printer took 102.99ms. Allocated memory is still 327.2MB. Free memory was 202.9MB in the beginning and 193.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 94]: integer overflow possible integer overflow possible We found a FailurePath: [L82] int a; [L83] int n; [L84] int x; [L85] int y; [L86] int z; [L87] a = __VERIFIER_nondet_int() [L88] n = 0 [L89] x = 0 [L90] y = 1 [L91] z = 6 [L92] CALL func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}] [L53] COND TRUE 1 [L56] EXPR \read(*z) [L56] EXPR \read(*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L56] EXPR 6 * (*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L56] EXPR (6 * (*n)) + 6 VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L56] CALL __VERIFIER_assert((*z) == ((6 * (*n)) + 6)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L56] RET __VERIFIER_assert((*z) == ((6 * (*n)) + 6)) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L57] EXPR \read(*y) [L57] EXPR \read(*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L57] EXPR 3 * (*n) [L57] EXPR \read(*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L57] EXPR (3 * (*n)) * (*n) [L57] EXPR \read(*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L57] EXPR 3 * (*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L57] EXPR ((3 * (*n)) * (*n)) + (3 * (*n)) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L57] EXPR (((3 * (*n)) * (*n)) + (3 * (*n))) + 1 VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L57] CALL __VERIFIER_assert((*y) == ((((3 * (*n)) * (*n)) + (3 * (*n))) + 1)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L57] RET __VERIFIER_assert((*y) == ((((3 * (*n)) * (*n)) + (3 * (*n))) + 1)) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L58] EXPR \read(*x) [L58] EXPR \read(*n) [L58] EXPR \read(*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L58] EXPR (*n) * (*n) [L58] EXPR \read(*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L58] EXPR ((*n) * (*n)) * (*n) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L58] CALL __VERIFIER_assert((*x) == (((*n) * (*n)) * (*n))) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L58] RET __VERIFIER_assert((*x) == (((*n) * (*n)) * (*n))) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR \read(*y) [L59] EXPR \read(*z) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR (*y) * (*z) [L59] EXPR \read(*x) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR 18 * (*x) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR ((*y) * (*z)) - (18 * (*x)) [L59] EXPR \read(*y) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR 12 * (*y) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR (((*y) * (*z)) - (18 * (*x))) - (12 * (*y)) [L59] EXPR \read(*z) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR 2 * (*z) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR ((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z)) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] EXPR (((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6 VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L59] CALL __VERIFIER_assert(((((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L59] RET __VERIFIER_assert(((((((*y) * (*z)) - (18 * (*x))) - (12 * (*y))) + (2 * (*z))) - 6) == 0) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L60] EXPR \read(*z) [L60] EXPR \read(*z) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L60] EXPR (*z) * (*z) [L60] EXPR \read(*y) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L60] EXPR 12 * (*y) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L60] EXPR ((*z) * (*z)) - (12 * (*y)) [L60] EXPR \read(*z) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L60] EXPR 6 * (*z) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L60] EXPR (((*z) * (*z)) - (12 * (*y))) - (6 * (*z)) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L60] EXPR ((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12 VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L60] CALL __VERIFIER_assert((((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L60] RET __VERIFIER_assert((((((*z) * (*z)) - (12 * (*y))) - (6 * (*z))) + 12) == 0) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L61] EXPR \read(*n) [L61] EXPR \read(*a) VAL [\old(a)={4:0}, \old(n)={7:0}, \old(x)={6:0}, \old(y)={5:0}, \old(z)={8:0}, a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L61] COND TRUE !((*n) <= (*a)) [L92] RET func_to_recursive_line_27_to_39_0(&y, &x, &z, &n, &a) VAL [a={4:0}, n={7:0}, x={6:0}, y={5:0}, z={8:0}] [L93] EXPR \read(z) [L93] EXPR \read(n) [L93] EXPR 6 * n VAL [a={4:0}, x={6:0}, y={5:0}, z={8:0}] [L93] EXPR (6 * n) + 6 VAL [a={4:0}, x={6:0}, y={5:0}, z={8:0}] [L93] CALL __VERIFIER_assert(z == ((6 * n) + 6)) [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L93] RET __VERIFIER_assert(z == ((6 * n) + 6)) VAL [a={4:0}, x={6:0}, y={5:0}, z={8:0}] [L94] EXPR \read(a) [L94] 6 * a VAL [a={4:0}, x={6:0}, y={5:0}, z={8:0}] - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 95]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 94]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 317 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 30, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11468 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11379 mSDsluCounter, 55798 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47460 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9441 IncrementalHoareTripleChecker+Invalid, 10051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 8338 mSDtfsCounter, 9441 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1244 GetRequests, 839 SyntacticMatches, 54 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=28, InterpolantAutomatonStates: 263, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 2721 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2441 NumberOfCodeBlocks, 2441 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2156 ConstructedInterpolants, 278 QuantifiedInterpolants, 21290 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2590 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 36 InterpolantComputations, 22 PerfectInterpolantSequences, 683/789 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 14:34:38,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)