./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard.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 55885307ad7991ec619705bd65f9ccb0a7f28b4003909403684402b81add0d87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:04:37,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:04:37,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:04:37,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:04:37,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:04:37,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:04:37,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:04:37,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:04:37,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:04:37,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:04:37,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:04:37,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:04:37,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:04:37,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:04:37,224 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:04:37,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:04:37,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:04:37,224 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:04:37,224 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:04:37,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:04:37,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:04:37,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:04:37,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:04:37,226 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 -> 55885307ad7991ec619705bd65f9ccb0a7f28b4003909403684402b81add0d87 [2025-02-08 10:04:37,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:04:37,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:04:37,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:04:37,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:04:37,496 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:04:37,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_hard.c [2025-02-08 10:04:38,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/750f02707/1e82512f613848f797a7b9e8ee1c622a/FLAG46430ddcd [2025-02-08 10:04:38,899 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:04:38,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_hard.c [2025-02-08 10:04:38,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/750f02707/1e82512f613848f797a7b9e8ee1c622a/FLAG46430ddcd [2025-02-08 10:04:38,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/750f02707/1e82512f613848f797a7b9e8ee1c622a [2025-02-08 10:04:38,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:04:38,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:04:38,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:04:38,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:04:38,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:04:38,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:04:38" (1/1) ... [2025-02-08 10:04:38,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b20ebe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:38, skipping insertion in model container [2025-02-08 10:04:38,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:04:38" (1/1) ... [2025-02-08 10:04:38,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:04:39,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:04:39,094 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:04:39,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:04:39,131 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:04:39,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39 WrapperNode [2025-02-08 10:04:39,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:04:39,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:04:39,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:04:39,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:04:39,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,167 INFO L138 Inliner]: procedures = 17, calls = 92, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2025-02-08 10:04:39,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:04:39,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:04:39,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:04:39,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:04:39,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,198 INFO L175 MemorySlicer]: Split 56 memory accesses to 8 slices as follows [8, 2, 7, 7, 6, 5, 9, 12]. 21 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [0, 2, 0, 7, 0, 0, 0, 0]. The 12 writes are split as follows [2, 0, 1, 0, 2, 1, 3, 3]. [2025-02-08 10:04:39,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:04:39,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:04:39,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:04:39,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:04:39,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (1/1) ... [2025-02-08 10:04:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:04:39,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:39,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 10:04:39,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 10:04:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:04:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:04:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:04:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:04:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:04:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:04:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 10:04:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 10:04:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 10:04:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_41_to_51_0 [2025-02-08 10:04:39,270 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_41_to_51_0 [2025-02-08 10:04:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:04:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_38_0 [2025-02-08 10:04:39,271 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_38_0 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 10:04:39,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:04:39,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:04:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:04:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:04:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:04:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:04:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:04:39,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 10:04:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 10:04:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 10:04:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:04:39,273 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:04:39,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:04:39,373 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:04:39,375 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:04:39,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset;call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset);havoc main_~#r~0#1.base, main_~#r~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#p~0#1.base, main_~#p~0#1.offset);havoc main_~#p~0#1.base, main_~#p~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset; [2025-02-08 10:04:39,616 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-02-08 10:04:39,617 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:04:39,624 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:04:39,624 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:04:39,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:39 BoogieIcfgContainer [2025-02-08 10:04:39,624 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:04:39,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:04:39,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:04:39,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:04:39,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:04:38" (1/3) ... [2025-02-08 10:04:39,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c69b70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:04:39, skipping insertion in model container [2025-02-08 10:04:39,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:04:39" (2/3) ... [2025-02-08 10:04:39,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c69b70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:04:39, skipping insertion in model container [2025-02-08 10:04:39,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:39" (3/3) ... [2025-02-08 10:04:39,631 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_hard.c [2025-02-08 10:04:39,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:04:39,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_hard.c that has 4 procedures, 88 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-02-08 10:04:39,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:04:39,697 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;@cc8074c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:04:39,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-08 10:04:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 75 states have internal predecessors, (80), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 10:04:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 10:04:39,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:39,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:39,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_41_to_51_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:04:39,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 389291393, now seen corresponding path program 1 times [2025-02-08 10:04:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:39,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839023927] [2025-02-08 10:04:39,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:39,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 10:04:39,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 10:04:39,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:39,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:04:39,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:39,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839023927] [2025-02-08 10:04:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839023927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:39,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 10:04:39,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991704043] [2025-02-08 10:04:39,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:39,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 10:04:39,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:39,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 10:04:39,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:04:39,910 INFO L87 Difference]: Start difference. First operand has 88 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 75 states have internal predecessors, (80), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:04:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:39,937 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2025-02-08 10:04:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 10:04:39,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 10:04:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:39,945 INFO L225 Difference]: With dead ends: 174 [2025-02-08 10:04:39,945 INFO L226 Difference]: Without dead ends: 81 [2025-02-08 10:04:39,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 10:04:39,953 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:39,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:04:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-08 10:04:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-08 10:04:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 70 states have internal predecessors, (71), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 10:04:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-02-08 10:04:39,991 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 12 [2025-02-08 10:04:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:39,991 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-02-08 10:04:39,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 10:04:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-02-08 10:04:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 10:04:39,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:39,993 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:39,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:04:39,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_31_to_38_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:04:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash 731850132, now seen corresponding path program 1 times [2025-02-08 10:04:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010713242] [2025-02-08 10:04:39,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:39,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:40,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 10:04:40,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 10:04:40,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:40,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061378459] [2025-02-08 10:04:40,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:40,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:40,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:40,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:40,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 10:04:40,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 10:04:40,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 10:04:40,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:40,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:40,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 10:04:40,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:40,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 10:04:40,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:04:40,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 10:04:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:04:40,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010713242] [2025-02-08 10:04:40,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:40,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061378459] [2025-02-08 10:04:40,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061378459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:40,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:40,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:04:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210863784] [2025-02-08 10:04:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:40,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 10:04:40,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:40,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 10:04:40,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:04:40,524 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:04:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:40,725 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-02-08 10:04:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 10:04:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-08 10:04:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:40,728 INFO L225 Difference]: With dead ends: 147 [2025-02-08 10:04:40,728 INFO L226 Difference]: Without dead ends: 146 [2025-02-08 10:04:40,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 10:04:40,728 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 106 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:40,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 398 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-08 10:04:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2025-02-08 10:04:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 94 states have internal predecessors, (104), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2025-02-08 10:04:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2025-02-08 10:04:40,750 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 19 [2025-02-08 10:04:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:40,750 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2025-02-08 10:04:40,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:04:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2025-02-08 10:04:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 10:04:40,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:40,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:40,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 10:04:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:40,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_31_to_38_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:04:40,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1212517640, now seen corresponding path program 1 times [2025-02-08 10:04:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387616974] [2025-02-08 10:04:40,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:40,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 10:04:40,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 10:04:40,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:40,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:40,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735227174] [2025-02-08 10:04:40,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:40,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:40,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:40,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 10:04:41,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 10:04:41,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 10:04:41,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:41,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:41,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 10:04:41,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:04:41,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-02-08 10:04:41,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 10:04:41,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 10:04:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 10:04:41,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:04:41,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387616974] [2025-02-08 10:04:41,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:04:41,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735227174] [2025-02-08 10:04:41,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735227174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:41,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:41,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 10:04:41,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231649476] [2025-02-08 10:04:41,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:41,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 10:04:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:41,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 10:04:41,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 10:04:41,428 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:04:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:41,704 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2025-02-08 10:04:41,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 10:04:41,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-02-08 10:04:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:41,705 INFO L225 Difference]: With dead ends: 146 [2025-02-08 10:04:41,705 INFO L226 Difference]: Without dead ends: 145 [2025-02-08 10:04:41,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-02-08 10:04:41,706 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:41,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 476 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 10:04:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-08 10:04:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2025-02-08 10:04:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 94 states have internal predecessors, (103), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2025-02-08 10:04:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2025-02-08 10:04:41,718 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 20 [2025-02-08 10:04:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:41,718 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2025-02-08 10:04:41,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:04:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2025-02-08 10:04:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 10:04:41,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:41,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:41,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 10:04:41,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:41,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_31_to_38_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:04:41,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash -722182711, now seen corresponding path program 1 times [2025-02-08 10:04:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898298636] [2025-02-08 10:04:41,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:41,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 10:04:41,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 10:04:41,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:41,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 10:04:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898298636] [2025-02-08 10:04:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898298636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 10:04:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331827891] [2025-02-08 10:04:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 10:04:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 10:04:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 10:04:42,340 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:04:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:42,467 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2025-02-08 10:04:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 10:04:42,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-02-08 10:04:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:42,469 INFO L225 Difference]: With dead ends: 118 [2025-02-08 10:04:42,469 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 10:04:42,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 10:04:42,471 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 49 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:42,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 377 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 10:04:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-02-08 10:04:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 94 states have internal predecessors, (103), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2025-02-08 10:04:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2025-02-08 10:04:42,479 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 28 [2025-02-08 10:04:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:42,480 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2025-02-08 10:04:42,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 10:04:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2025-02-08 10:04:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 10:04:42,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:42,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:04:42,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 10:04:42,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_31_to_38_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-02-08 10:04:42,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash -912827543, now seen corresponding path program 1 times [2025-02-08 10:04:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033068539] [2025-02-08 10:04:42,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:42,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:42,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:04:42,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:04:42,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:42,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:04:42,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652602751] [2025-02-08 10:04:42,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:42,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:04:42,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:04:42,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:04:42,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 10:04:42,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:04:42,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:04:42,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:42,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 10:04:42,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 10:04:42,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 10:04:42,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 10:04:42,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:42,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 10:04:42,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 10:04:42,656 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 10:04:42,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location func_to_recursive_line_31_to_38_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-02-08 10:04:42,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_41_to_51_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location func_to_recursive_line_31_to_38_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-02-08 10:04:42,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-02-08 10:04:42,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 10:04:42,860 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-02-08 10:04:42,863 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 10:04:42,888 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 10:04:42,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 10:04:42 BoogieIcfgContainer [2025-02-08 10:04:42,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 10:04:42,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 10:04:42,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 10:04:42,891 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 10:04:42,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:04:39" (3/4) ... [2025-02-08 10:04:42,892 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 10:04:42,933 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-02-08 10:04:42,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 10:04:42,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 10:04:42,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 10:04:42,979 INFO L158 Benchmark]: Toolchain (without parser) took 4052.87ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 47.7MB in the end (delta: 65.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2025-02-08 10:04:42,979 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:04:42,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.38ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:04:42,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.64ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:04:42,980 INFO L158 Benchmark]: Boogie Preprocessor took 46.97ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 10:04:42,980 INFO L158 Benchmark]: IcfgBuilder took 407.68ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 73.6MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 10:04:42,980 INFO L158 Benchmark]: TraceAbstraction took 3264.64ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 54.5MB in the end (delta: 18.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2025-02-08 10:04:42,980 INFO L158 Benchmark]: Witness Printer took 87.04ms. Allocated memory is still 142.6MB. Free memory was 54.5MB in the beginning and 47.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 10:04:42,981 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.38ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.64ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.3MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.97ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 407.68ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 73.6MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3264.64ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 54.5MB in the end (delta: 18.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 87.04ms. Allocated memory is still 142.6MB. Free memory was 54.5MB in the beginning and 47.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 98]: integer overflow possible integer overflow possible We found a FailurePath: [L110] int A; [L111] int B; [L112] int r; [L113] int d; [L114] int p; [L115] int q; [L116] A = __VERIFIER_nondet_int() [L117] B = __VERIFIER_nondet_int() [L118] EXPR \read(B) [L118] CALL assume_abort_if_not(B >= 1) [L26] COND FALSE !(!cond) [L118] RET assume_abort_if_not(B >= 1) [L119] EXPR \read(A) [L119] r = A [L120] EXPR \read(B) [L120] d = B [L121] p = 1 [L122] q = 0 [L123] CALL func_to_recursive_line_31_to_38_0(&q, &B, &d, &A, &r, &p) VAL [\old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}] [L85] COND TRUE 1 [L88] EXPR \read(*q) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L88] CALL __VERIFIER_assert((*q) == 0) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L88] RET __VERIFIER_assert((*q) == 0) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L89] EXPR \read(*r) [L89] EXPR \read(*A) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L89] CALL __VERIFIER_assert((*r) == (*A)) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L89] RET __VERIFIER_assert((*r) == (*A)) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L90] EXPR \read(*d) [L90] EXPR \read(*B) [L90] EXPR \read(*p) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L90] EXPR (*B) * (*p) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L90] CALL __VERIFIER_assert((*d) == ((*B) * (*p))) VAL [\old(cond)=1] [L37] COND FALSE !(!cond) VAL [\old(cond)=1] [L90] RET __VERIFIER_assert((*d) == ((*B) * (*p))) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L91] EXPR \read(*r) [L91] EXPR \read(*d) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L91] COND FALSE !(!((*r) >= (*d))) [L98] EXPR \read(*d) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] [L98] 2 * (*d) VAL [A={9:0}, B={8:0}, \old(A)={9:0}, \old(B)={8:0}, \old(d)={5:0}, \old(p)={6:0}, \old(q)={7:0}, \old(r)={4:0}, d={5:0}, p={6:0}, q={7:0}, r={4:0}] - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 99]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 98]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 88 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 1349 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1036 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 425 IncrementalHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 313 mSDtfsCounter, 425 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 65 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 75 ConstructedInterpolants, 16 QuantifiedInterpolants, 821 SizeOfPredicates, 24 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 20/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 10:04:42,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)