./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfbeed813c4c61f00fa3f37e016718a299be7911d54e721c8910a31480a25397 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:48:40,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:48:40,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:48:40,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:48:40,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:48:40,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:48:40,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:48:40,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:48:40,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:48:40,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:48:40,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:48:40,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:48:40,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:48:40,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:48:40,314 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:48:40,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:48:40,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:48:40,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:48:40,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:48:40,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:48:40,318 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfbeed813c4c61f00fa3f37e016718a299be7911d54e721c8910a31480a25397 [2025-03-17 15:48:40,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:48:40,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:48:40,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:48:40,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:48:40,538 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:48:40,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c [2025-03-17 15:48:41,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c545cd404/575dcaef90154eac9c966a4be91325c3/FLAGcf6e20a86 [2025-03-17 15:48:41,890 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:48:41,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c [2025-03-17 15:48:41,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c545cd404/575dcaef90154eac9c966a4be91325c3/FLAGcf6e20a86 [2025-03-17 15:48:41,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c545cd404/575dcaef90154eac9c966a4be91325c3 [2025-03-17 15:48:41,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:48:41,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:48:41,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:48:41,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:48:41,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:48:41,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:48:41" (1/1) ... [2025-03-17 15:48:41,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7684ddac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:41, skipping insertion in model container [2025-03-17 15:48:41,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:48:41" (1/1) ... [2025-03-17 15:48:41,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:48:42,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:48:42,095 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:48:42,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:48:42,128 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:48:42,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42 WrapperNode [2025-03-17 15:48:42,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:48:42,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:48:42,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:48:42,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:48:42,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,164 INFO L138 Inliner]: procedures = 17, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-17 15:48:42,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:48:42,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:48:42,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:48:42,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:48:42,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,188 INFO L175 MemorySlicer]: Split 49 memory accesses to 7 slices as follows [2, 12, 9, 8, 7, 6, 5]. 24 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 12 writes are split as follows [0, 3, 3, 2, 1, 2, 1]. [2025-03-17 15:48:42,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,195 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:48:42,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:48:42,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:48:42,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:48:42,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (1/1) ... [2025-03-17 15:48:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:48:42,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:48:42,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:48:42,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:48:42,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_41_to_51_0 [2025-03-17 15:48:42,252 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_41_to_51_0 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_38_0 [2025-03-17 15:48:42,252 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_38_0 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:48:42,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:48:42,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:48:42,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:48:42,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:48:42,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:48:42,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:48:42,604 INFO L1322 $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-03-17 15:48:42,629 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-17 15:48:42,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:48:42,638 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:48:42,638 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:48:42,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:48:42 BoogieIcfgContainer [2025-03-17 15:48:42,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:48:42,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:48:42,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:48:42,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:48:42,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:48:41" (1/3) ... [2025-03-17 15:48:42,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54794528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:48:42, skipping insertion in model container [2025-03-17 15:48:42,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:48:42" (2/3) ... [2025-03-17 15:48:42,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54794528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:48:42, skipping insertion in model container [2025-03-17 15:48:42,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:48:42" (3/3) ... [2025-03-17 15:48:42,652 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_hard-ll.c [2025-03-17 15:48:42,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:48:42,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_hard-ll.c that has 4 procedures, 88 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-03-17 15:48:42,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:48:42,719 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;@489c1b4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:48:42,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-17 15:48:42,722 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-03-17 15:48:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 15:48:42,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:48:42,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:48:42,727 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-03-17 15:48:42,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:48:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 389291393, now seen corresponding path program 1 times [2025-03-17 15:48:42,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:48:42,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782124995] [2025-03-17 15:48:42,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:42,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:48:42,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 15:48:42,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 15:48:42,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:42,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:48:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:48:42,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:48:42,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782124995] [2025-03-17 15:48:42,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782124995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:48:42,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:48:42,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:48:42,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26225343] [2025-03-17 15:48:42,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:48:42,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:48:42,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:48:42,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:48:42,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:48:42,945 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-03-17 15:48:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:48:42,967 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2025-03-17 15:48:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:48:42,968 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-03-17 15:48:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:48:42,972 INFO L225 Difference]: With dead ends: 174 [2025-03-17 15:48:42,972 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 15:48:42,974 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-03-17 15:48:42,976 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-03-17 15:48:42,976 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-03-17 15:48:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 15:48:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 15:48:43,001 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-03-17 15:48:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2025-03-17 15:48:43,007 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 12 [2025-03-17 15:48:43,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:48:43,008 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2025-03-17 15:48:43,008 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-03-17 15:48:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2025-03-17 15:48:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 15:48:43,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:48:43,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:48:43,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:48:43,010 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-03-17 15:48:43,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:48:43,011 INFO L85 PathProgramCache]: Analyzing trace with hash 731850132, now seen corresponding path program 1 times [2025-03-17 15:48:43,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:48:43,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679399039] [2025-03-17 15:48:43,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:43,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:48:43,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:48:43,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:48:43,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:43,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:48:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815586958] [2025-03-17 15:48:43,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:43,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:48:43,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:48:43,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:48:43,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:48:43,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 15:48:43,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 15:48:43,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:43,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:48:43,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:48:43,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:48:43,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:48:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:48:43,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:48:43,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:48:43,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679399039] [2025-03-17 15:48:43,354 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:48:43,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815586958] [2025-03-17 15:48:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815586958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:48:43,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:48:43,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:48:43,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544244198] [2025-03-17 15:48:43,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:48:43,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:48:43,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:48:43,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:48:43,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:48:43,356 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 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-03-17 15:48:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:48:43,501 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-03-17 15:48:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:48:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-03-17 15:48:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:48:43,504 INFO L225 Difference]: With dead ends: 147 [2025-03-17 15:48:43,504 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 15:48:43,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:48:43,505 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:48:43,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 407 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:48:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 15:48:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2025-03-17 15:48:43,520 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-03-17 15:48:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions. [2025-03-17 15:48:43,523 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 19 [2025-03-17 15:48:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:48:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 136 transitions. [2025-03-17 15:48:43,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-03-17 15:48:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions. [2025-03-17 15:48:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 15:48:43,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:48:43,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:48:43,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:48:43,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:48:43,730 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-03-17 15:48:43,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:48:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1212517640, now seen corresponding path program 1 times [2025-03-17 15:48:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:48:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335136873] [2025-03-17 15:48:43,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:48:43,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:48:43,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:48:43,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:43,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:48:43,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146056468] [2025-03-17 15:48:43,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:43,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:48:43,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:48:43,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:48:43,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:48:43,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 15:48:43,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 15:48:43,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:43,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:48:43,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 15:48:43,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:48:43,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 15:48:43,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:48:44,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 15:48:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:48:44,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:48:44,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:48:44,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335136873] [2025-03-17 15:48:44,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:48:44,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146056468] [2025-03-17 15:48:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146056468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:48:44,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:48:44,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:48:44,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772098805] [2025-03-17 15:48:44,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:48:44,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:48:44,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:48:44,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:48:44,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:48:44,124 INFO L87 Difference]: Start difference. First operand 114 states and 136 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-03-17 15:48:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:48:44,326 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2025-03-17 15:48:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:48:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 20 [2025-03-17 15:48:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:48:44,328 INFO L225 Difference]: With dead ends: 146 [2025-03-17 15:48:44,328 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 15:48:44,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 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-03-17 15:48:44,329 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 102 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:48:44,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 401 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:48:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 15:48:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2025-03-17 15:48:44,338 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-03-17 15:48:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2025-03-17 15:48:44,339 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 20 [2025-03-17 15:48:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:48:44,339 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2025-03-17 15:48:44,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-03-17 15:48:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2025-03-17 15:48:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 15:48:44,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:48:44,340 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-03-17 15:48:44,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:48:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 15:48:44,541 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-03-17 15:48:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:48:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash -722182711, now seen corresponding path program 1 times [2025-03-17 15:48:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:48:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987418740] [2025-03-17 15:48:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:48:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:48:44,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:48:44,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:44,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:48:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:48:44,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:48:44,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987418740] [2025-03-17 15:48:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987418740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:48:44,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:48:44,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:48:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210753654] [2025-03-17 15:48:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:48:44,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:48:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:48:44,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:48:44,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:48:44,883 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 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-03-17 15:48:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:48:44,975 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2025-03-17 15:48:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:48:44,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 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-03-17 15:48:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:48:44,977 INFO L225 Difference]: With dead ends: 118 [2025-03-17 15:48:44,977 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 15:48:44,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:48:44,979 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 31 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:48:44,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 325 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:48:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 15:48:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-17 15:48:44,992 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-03-17 15:48:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2025-03-17 15:48:44,993 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 28 [2025-03-17 15:48:44,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:48:44,993 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2025-03-17 15:48:44,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 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-03-17 15:48:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2025-03-17 15:48:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 15:48:44,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:48:44,994 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-03-17 15:48:44,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:48:44,994 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-03-17 15:48:44,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:48:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash -912827543, now seen corresponding path program 1 times [2025-03-17 15:48:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:48:44,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135415171] [2025-03-17 15:48:44,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:44,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:48:45,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 15:48:45,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 15:48:45,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:45,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:48:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:48:45,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:48:45,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135415171] [2025-03-17 15:48:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135415171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:48:45,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:48:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:48:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006035672] [2025-03-17 15:48:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:48:45,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:48:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:48:45,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:48:45,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:48:45,184 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-03-17 15:48:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:48:45,290 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2025-03-17 15:48:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:48:45,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 29 [2025-03-17 15:48:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:48:45,291 INFO L225 Difference]: With dead ends: 118 [2025-03-17 15:48:45,291 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 15:48:45,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:48:45,292 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 15 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:48:45,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 367 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:48:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 15:48:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-17 15:48:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 96 states have internal predecessors, (105), 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-03-17 15:48:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2025-03-17 15:48:45,302 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 29 [2025-03-17 15:48:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:48:45,302 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2025-03-17 15:48:45,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-03-17 15:48:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2025-03-17 15:48:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 15:48:45,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:48:45,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:48:45,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:48:45,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_31_to_38_0Err1ASSERT_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-03-17 15:48:45,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:48:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1767117255, now seen corresponding path program 1 times [2025-03-17 15:48:45,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:48:45,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128782834] [2025-03-17 15:48:45,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:45,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:48:45,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:48:45,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:48:45,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:45,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:48:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:48:45,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:48:45,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128782834] [2025-03-17 15:48:45,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128782834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:48:45,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:48:45,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:48:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891278033] [2025-03-17 15:48:45,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:48:45,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:48:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:48:45,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:48:45,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:48:45,448 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (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-03-17 15:48:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:48:45,521 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2025-03-17 15:48:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:48:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (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 30 [2025-03-17 15:48:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:48:45,522 INFO L225 Difference]: With dead ends: 121 [2025-03-17 15:48:45,522 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 15:48:45,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:48:45,523 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 18 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:48:45,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 371 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:48:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 15:48:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-17 15:48:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 74 states have (on average 1.445945945945946) internal successors, (107), 98 states have internal predecessors, (107), 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-03-17 15:48:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2025-03-17 15:48:45,542 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 30 [2025-03-17 15:48:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:48:45,542 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2025-03-17 15:48:45,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (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-03-17 15:48:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2025-03-17 15:48:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 15:48:45,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:48:45,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:48:45,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:48:45,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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-03-17 15:48:45,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:48:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash -388343954, now seen corresponding path program 1 times [2025-03-17 15:48:45,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:48:45,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704040245] [2025-03-17 15:48:45,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:45,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:48:45,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 15:48:45,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 15:48:45,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:45,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:48:45,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101930279] [2025-03-17 15:48:45,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:45,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:48:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:48:45,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:48:45,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:48:45,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 15:48:45,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 15:48:45,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:45,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:48:45,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 15:48:45,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:48:45,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 15:48:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:48:45,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:48:45,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:48:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704040245] [2025-03-17 15:48:45,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:48:45,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101930279] [2025-03-17 15:48:45,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101930279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:48:45,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:48:45,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:48:45,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558349457] [2025-03-17 15:48:45,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:48:45,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:48:45,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:48:45,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:48:45,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:48:45,779 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:48:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:48:45,904 INFO L93 Difference]: Finished difference Result 176 states and 205 transitions. [2025-03-17 15:48:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:48:45,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-17 15:48:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:48:45,907 INFO L225 Difference]: With dead ends: 176 [2025-03-17 15:48:45,908 INFO L226 Difference]: Without dead ends: 174 [2025-03-17 15:48:45,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:48:45,908 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 97 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:48:45,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 344 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:48:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-17 15:48:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2025-03-17 15:48:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 95 states have (on average 1.431578947368421) internal successors, (136), 120 states have internal predecessors, (136), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2025-03-17 15:48:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2025-03-17 15:48:45,921 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 33 [2025-03-17 15:48:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:48:45,921 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2025-03-17 15:48:45,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:48:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2025-03-17 15:48:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:48:45,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:48:45,922 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:48:45,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:48:46,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:48:46,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_41_to_51_0Err11ASSERT_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-03-17 15:48:46,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:48:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 463615116, now seen corresponding path program 1 times [2025-03-17 15:48:46,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:48:46,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291447837] [2025-03-17 15:48:46,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:48:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:48:46,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:48:46,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:48:46,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:48:46,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat