./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_geo2-ll2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_geo2-ll2.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 0e4188e08c3f48775d359529becc8db180857d5f7b1b125f480e88f6efe9d6c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:36:14,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:36:14,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:36:14,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:36:14,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:36:14,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:36:14,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:36:14,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:36:14,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:36:14,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:36:14,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:36:14,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:36:14,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:36:14,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:36:14,365 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:36:14,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:36:14,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:36:14,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:36:14,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:36:14,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:36:14,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:36:14,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:36:14,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:36:14,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:36:14,368 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 -> 0e4188e08c3f48775d359529becc8db180857d5f7b1b125f480e88f6efe9d6c3 [2025-01-10 02:36:14,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:36:14,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:36:14,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:36:14,596 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:36:14,597 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:36:14,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_geo2-ll2.c [2025-01-10 02:36:15,828 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f583c8339/dcf14c5fc2c54a589db9ce7cd19aa739/FLAG058d2ae4c [2025-01-10 02:36:16,135 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:36:16,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_geo2-ll2.c [2025-01-10 02:36:16,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f583c8339/dcf14c5fc2c54a589db9ce7cd19aa739/FLAG058d2ae4c [2025-01-10 02:36:16,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f583c8339/dcf14c5fc2c54a589db9ce7cd19aa739 [2025-01-10 02:36:16,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:36:16,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:36:16,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:36:16,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:36:16,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:36:16,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3748fba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16, skipping insertion in model container [2025-01-10 02:36:16,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:36:16,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:36:16,324 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:36:16,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:36:16,357 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:36:16,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16 WrapperNode [2025-01-10 02:36:16,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:36:16,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:36:16,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:36:16,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:36:16,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,392 INFO L138 Inliner]: procedures = 16, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-01-10 02:36:16,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:36:16,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:36:16,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:36:16,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:36:16,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,437 INFO L175 MemorySlicer]: Split 27 memory accesses to 6 slices as follows [2, 4, 7, 2, 7, 5]. 26 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 8 writes are split as follows [0, 2, 1, 1, 2, 2]. [2025-01-10 02:36:16,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:36:16,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:36:16,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:36:16,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:36:16,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (1/1) ... [2025-01-10 02:36:16,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:36:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:16,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:36:16,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:36:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:36:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:36:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:36:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:36:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_30_to_38_0 [2025-01-10 02:36:16,537 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_30_to_38_0 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:36:16,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:36:16,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:36:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:36:16,615 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:36:16,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:36:16,906 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-01-10 02:36:16,906 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:36:16,917 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:36:16,917 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:36:16,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:16 BoogieIcfgContainer [2025-01-10 02:36:16,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:36:16,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:36:16,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:36:16,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:36:16,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:36:16" (1/3) ... [2025-01-10 02:36:16,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a134e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:16, skipping insertion in model container [2025-01-10 02:36:16,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:16" (2/3) ... [2025-01-10 02:36:16,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a134e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:16, skipping insertion in model container [2025-01-10 02:36:16,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:16" (3/3) ... [2025-01-10 02:36:16,930 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_geo2-ll2.c [2025-01-10 02:36:16,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:36:16,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_geo2-ll2.c that has 3 procedures, 79 locations, 1 initial locations, 0 loop locations, and 28 error locations. [2025-01-10 02:36:16,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:36:17,000 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;@59b5bd00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:36:17,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-10 02:36:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 73 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:36:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:36:17,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:17,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:36:17,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:17,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1895540477, now seen corresponding path program 1 times [2025-01-10 02:36:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:17,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113523815] [2025-01-10 02:36:17,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:17,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:36:17,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:36:17,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:17,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:17,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1359196560] [2025-01-10 02:36:17,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:17,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:17,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:17,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:36:17,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:36:17,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:36:17,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:36:17,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:17,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:17,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 02:36:17,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:17,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:36:17,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:17,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 02:36:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:17,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:17,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113523815] [2025-01-10 02:36:17,465 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:17,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359196560] [2025-01-10 02:36:17,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359196560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:17,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:17,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:36:17,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758661783] [2025-01-10 02:36:17,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:17,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:36:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:17,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:36:17,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:36:17,486 INFO L87 Difference]: Start difference. First operand has 79 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 73 states have internal predecessors, (75), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:36:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:17,737 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2025-01-10 02:36:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:36:17,738 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-01-10 02:36:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:17,743 INFO L225 Difference]: With dead ends: 200 [2025-01-10 02:36:17,743 INFO L226 Difference]: Without dead ends: 118 [2025-01-10 02:36:17,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:17,748 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 89 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:17,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 300 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-10 02:36:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2025-01-10 02:36:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.6851851851851851) internal successors, (91), 82 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2025-01-10 02:36:17,787 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 6 [2025-01-10 02:36:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:17,787 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2025-01-10 02:36:17,787 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-01-10 02:36:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2025-01-10 02:36:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 02:36:17,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:17,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:17,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:36:17,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 02:36:17,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:17,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1367787394, now seen corresponding path program 1 times [2025-01-10 02:36:17,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:17,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488762336] [2025-01-10 02:36:17,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:17,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:18,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:36:18,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:36:18,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:18,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100453620] [2025-01-10 02:36:18,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:18,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:18,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:18,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:36:18,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:36:18,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 02:36:18,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 02:36:18,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:18,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:18,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 02:36:18,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:18,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:18,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:36:18,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 02:36:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:18,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:18,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488762336] [2025-01-10 02:36:18,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100453620] [2025-01-10 02:36:18,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100453620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:18,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:18,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:36:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065741965] [2025-01-10 02:36:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:18,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:36:18,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:18,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:36:18,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:36:18,180 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-01-10 02:36:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:18,332 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2025-01-10 02:36:18,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:36:18,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 7 [2025-01-10 02:36:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:18,334 INFO L225 Difference]: With dead ends: 118 [2025-01-10 02:36:18,334 INFO L226 Difference]: Without dead ends: 116 [2025-01-10 02:36:18,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:18,335 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 84 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:18,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 271 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-10 02:36:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2025-01-10 02:36:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 82 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2025-01-10 02:36:18,343 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 7 [2025-01-10 02:36:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:18,343 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2025-01-10 02:36:18,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-01-10 02:36:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2025-01-10 02:36:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 02:36:18,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:18,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:18,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:36:18,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:18,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_30_to_38_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:18,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1399556295, now seen corresponding path program 1 times [2025-01-10 02:36:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976276100] [2025-01-10 02:36:18,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:18,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:36:18,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:36:18,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:18,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:19,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:19,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976276100] [2025-01-10 02:36:19,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976276100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:19,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233807465] [2025-01-10 02:36:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:19,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:19,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:19,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:19,025 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:36:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:19,205 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2025-01-10 02:36:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:19,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 02:36:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:19,207 INFO L225 Difference]: With dead ends: 116 [2025-01-10 02:36:19,207 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 02:36:19,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:36:19,207 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 75 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:19,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 326 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 02:36:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2025-01-10 02:36:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 82 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2025-01-10 02:36:19,220 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 10 [2025-01-10 02:36:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:19,220 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2025-01-10 02:36:19,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:36:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2025-01-10 02:36:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 02:36:19,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:19,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:19,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:36:19,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_30_to_38_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:19,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash 436572230, now seen corresponding path program 1 times [2025-01-10 02:36:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420552553] [2025-01-10 02:36:19,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:19,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 02:36:19,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 02:36:19,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:19,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:19,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:19,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420552553] [2025-01-10 02:36:19,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420552553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:19,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:19,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:19,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60864139] [2025-01-10 02:36:19,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:19,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:19,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:19,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:19,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:19,530 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:36:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:19,741 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2025-01-10 02:36:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:19,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 02:36:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:19,742 INFO L225 Difference]: With dead ends: 115 [2025-01-10 02:36:19,744 INFO L226 Difference]: Without dead ends: 114 [2025-01-10 02:36:19,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:36:19,745 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 81 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:19,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 297 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:36:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-10 02:36:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2025-01-10 02:36:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 82 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2025-01-10 02:36:19,756 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 11 [2025-01-10 02:36:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:19,757 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2025-01-10 02:36:19,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:36:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2025-01-10 02:36:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:36:19,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:19,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:19,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:36:19,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_30_to_38_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:19,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash 648837289, now seen corresponding path program 1 times [2025-01-10 02:36:19,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:19,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569904692] [2025-01-10 02:36:19,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:19,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:36:19,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:36:19,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:19,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [158946914] [2025-01-10 02:36:19,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:19,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:19,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:19,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:36:19,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:36:19,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:36:19,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:36:19,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:19,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:19,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 02:36:19,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:19,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:36:19,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:19,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 02:36:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:19,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569904692] [2025-01-10 02:36:19,970 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158946914] [2025-01-10 02:36:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158946914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:19,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:19,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:36:19,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388257064] [2025-01-10 02:36:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:19,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:36:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:19,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:36:19,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:36:19,972 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:36:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:20,071 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2025-01-10 02:36:20,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:36:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 02:36:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:20,072 INFO L225 Difference]: With dead ends: 122 [2025-01-10 02:36:20,072 INFO L226 Difference]: Without dead ends: 121 [2025-01-10 02:36:20,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:20,073 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:20,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-10 02:36:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 89. [2025-01-10 02:36:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 82 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2025-01-10 02:36:20,080 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 12 [2025-01-10 02:36:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:20,080 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2025-01-10 02:36:20,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-01-10 02:36:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2025-01-10 02:36:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 02:36:20,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:20,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:20,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:36:20,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:20,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_30_to_38_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:20,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1360880472, now seen corresponding path program 1 times [2025-01-10 02:36:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:20,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796156282] [2025-01-10 02:36:20,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:20,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:20,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:36:20,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:36:20,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:20,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:20,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683419634] [2025-01-10 02:36:20,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:20,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:20,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:20,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:36:20,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:36:20,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:36:20,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:36:20,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:20,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:20,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 02:36:20,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:20,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:36:20,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:20,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 02:36:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:20,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796156282] [2025-01-10 02:36:20,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683419634] [2025-01-10 02:36:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683419634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:36:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663613993] [2025-01-10 02:36:20,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:20,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:36:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:20,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:36:20,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:36:20,464 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:36:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:20,563 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2025-01-10 02:36:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:36:20,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 02:36:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:20,564 INFO L225 Difference]: With dead ends: 121 [2025-01-10 02:36:20,564 INFO L226 Difference]: Without dead ends: 120 [2025-01-10 02:36:20,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:20,565 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 74 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:20,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 288 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-10 02:36:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2025-01-10 02:36:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 82 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2025-01-10 02:36:20,577 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 13 [2025-01-10 02:36:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:20,577 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2025-01-10 02:36:20,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:36:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2025-01-10 02:36:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:36:20,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:20,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:20,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:36:20,777 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,SelfDestructingSolverStorable5 [2025-01-10 02:36:20,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_30_to_38_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash 762378379, now seen corresponding path program 1 times [2025-01-10 02:36:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:20,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445862752] [2025-01-10 02:36:20,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:20,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:20,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:36:20,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:36:20,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:20,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302421335] [2025-01-10 02:36:20,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:20,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:20,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:20,803 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:36:20,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:36:20,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:36:20,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:36:20,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:20,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:20,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-10 02:36:20,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:20,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:20,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:20,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:36:21,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-10 02:36:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:21,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:21,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445862752] [2025-01-10 02:36:21,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:21,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302421335] [2025-01-10 02:36:21,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302421335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:21,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:21,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:36:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165854893] [2025-01-10 02:36:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:21,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:36:21,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:21,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:36:21,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:21,128 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-01-10 02:36:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:21,262 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2025-01-10 02:36:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:36:21,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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 14 [2025-01-10 02:36:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:21,263 INFO L225 Difference]: With dead ends: 112 [2025-01-10 02:36:21,263 INFO L226 Difference]: Without dead ends: 110 [2025-01-10 02:36:21,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:36:21,264 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 71 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:21,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 325 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-10 02:36:21,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2025-01-10 02:36:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.537037037037037) internal successors, (83), 82 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2025-01-10 02:36:21,269 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 14 [2025-01-10 02:36:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:21,269 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2025-01-10 02:36:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-01-10 02:36:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2025-01-10 02:36:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:36:21,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:21,270 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-01-10 02:36:21,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:36:21,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:21,471 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_30_to_38_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:21,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash 418095421, now seen corresponding path program 1 times [2025-01-10 02:36:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:21,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812927109] [2025-01-10 02:36:21,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:21,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:21,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:36:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:36:21,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:21,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:21,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:21,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812927109] [2025-01-10 02:36:21,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812927109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:21,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:21,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:21,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315542299] [2025-01-10 02:36:21,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:21,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:21,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:21,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:21,654 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-01-10 02:36:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:21,710 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2025-01-10 02:36:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:21,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-01-10 02:36:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:21,711 INFO L225 Difference]: With dead ends: 114 [2025-01-10 02:36:21,712 INFO L226 Difference]: Without dead ends: 113 [2025-01-10 02:36:21,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:36:21,712 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:21,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 331 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:36:21,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-10 02:36:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2025-01-10 02:36:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 83 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2025-01-10 02:36:21,719 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 23 [2025-01-10 02:36:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:21,719 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2025-01-10 02:36:21,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-01-10 02:36:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2025-01-10 02:36:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:36:21,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:21,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:21,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:36:21,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_30_to_38_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:21,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 76056226, now seen corresponding path program 1 times [2025-01-10 02:36:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:21,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552261763] [2025-01-10 02:36:21,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:21,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:36:21,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:36:21,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:21,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552261763] [2025-01-10 02:36:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552261763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:21,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862582641] [2025-01-10 02:36:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:21,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:21,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:21,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:21,884 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:36:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:21,946 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2025-01-10 02:36:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2025-01-10 02:36:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:21,948 INFO L225 Difference]: With dead ends: 113 [2025-01-10 02:36:21,948 INFO L226 Difference]: Without dead ends: 112 [2025-01-10 02:36:21,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:36:21,949 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 41 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:21,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 383 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:36:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-10 02:36:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2025-01-10 02:36:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 84 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2025-01-10 02:36:21,960 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 24 [2025-01-10 02:36:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:21,960 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2025-01-10 02:36:21,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:36:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2025-01-10 02:36:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:36:21,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:21,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:21,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:36:21,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_30_to_38_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:21,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1937224225, now seen corresponding path program 1 times [2025-01-10 02:36:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123897033] [2025-01-10 02:36:21,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:21,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:36:21,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:36:21,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:21,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744338095] [2025-01-10 02:36:21,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:21,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:21,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:21,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:36:21,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:36:22,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:36:22,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:36:22,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:22,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 02:36:22,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:22,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:36:22,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:22,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-10 02:36:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:22,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:22,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:22,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123897033] [2025-01-10 02:36:22,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:22,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744338095] [2025-01-10 02:36:22,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744338095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:22,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:22,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175608773] [2025-01-10 02:36:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:22,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:22,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:22,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:22,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:22,236 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:36:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:22,356 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2025-01-10 02:36:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:22,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-10 02:36:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:22,357 INFO L225 Difference]: With dead ends: 124 [2025-01-10 02:36:22,358 INFO L226 Difference]: Without dead ends: 122 [2025-01-10 02:36:22,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:36:22,360 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:22,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 347 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-10 02:36:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 98. [2025-01-10 02:36:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 90 states have internal predecessors, (92), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-10 02:36:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2025-01-10 02:36:22,365 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 25 [2025-01-10 02:36:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:22,365 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2025-01-10 02:36:22,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:36:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2025-01-10 02:36:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:36:22,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:22,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:22,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:36:22,567 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,SelfDestructingSolverStorable9 [2025-01-10 02:36:22,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_30_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_30_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 26 more)] === [2025-01-10 02:36:22,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:22,568 INFO L85 PathProgramCache]: Analyzing trace with hash 75296849, now seen corresponding path program 1 times [2025-01-10 02:36:22,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:22,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030809003] [2025-01-10 02:36:22,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:22,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:22,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:36:22,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:36:22,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:22,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396902288] [2025-01-10 02:36:22,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:22,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:22,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:22,598 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:36:22,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:36:22,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:36:22,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:36:22,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:22,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:22,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-10 02:36:22,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:22,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:22,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 02:36:22,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:36:39,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 02:36:39,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2025-01-10 02:36:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:39,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030809003] [2025-01-10 02:36:39,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396902288] [2025-01-10 02:36:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396902288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:39,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:39,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 02:36:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627543610] [2025-01-10 02:36:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:39,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 02:36:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:39,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 02:36:39,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=115, Unknown=4, NotChecked=0, Total=156 [2025-01-10 02:36:39,233 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 13 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:36:43,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:36:47,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:36:55,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:03,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:07,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:11,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:15,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:19,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:23,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:27,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:31,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:35,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:39,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:43,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:37:47,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]