./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.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 6f3643eb7577eb0ba12bcd7a7f20ec9e29deb69664963fe3575fff225cd03ad0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:33:34,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:33:34,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:33:34,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:33:34,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:33:34,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:33:34,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:33:34,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:33:34,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:33:34,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:33:34,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:33:34,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:33:34,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:33:34,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:33:34,261 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:33:34,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:33:34,262 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:33:34,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:33:34,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:33:34,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:33:34,263 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 -> 6f3643eb7577eb0ba12bcd7a7f20ec9e29deb69664963fe3575fff225cd03ad0 [2025-03-04 11:33:34,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:33:34,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:33:34,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:33:34,499 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:33:34,499 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:33:34,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c [2025-03-04 11:33:35,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36b2ebe6/ad78a24f58494a3d90da9dac894bf30a/FLAG764c5f84a [2025-03-04 11:33:35,811 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:33:35,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps5.c [2025-03-04 11:33:35,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36b2ebe6/ad78a24f58494a3d90da9dac894bf30a/FLAG764c5f84a [2025-03-04 11:33:36,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36b2ebe6/ad78a24f58494a3d90da9dac894bf30a [2025-03-04 11:33:36,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:33:36,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:33:36,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:33:36,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:33:36,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:33:36,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58691968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36, skipping insertion in model container [2025-03-04 11:33:36,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:33:36,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:33:36,319 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:33:36,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:33:36,356 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:33:36,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36 WrapperNode [2025-03-04 11:33:36,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:33:36,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:33:36,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:33:36,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:33:36,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,370 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,389 INFO L138 Inliner]: procedures = 16, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2025-03-04 11:33:36,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:33:36,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:33:36,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:33:36,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:33:36,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,425 INFO L175 MemorySlicer]: Split 56 memory accesses to 6 slices as follows [2, 4, 6, 36, 5, 3]. 64 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 0, 6, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 2, 2, 1]. [2025-03-04 11:33:36,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:33:36,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:33:36,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:33:36,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:33:36,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (1/1) ... [2025-03-04 11:33:36,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:33:36,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:36,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:33:36,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_33_0 [2025-03-04 11:33:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_33_0 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:33:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:33:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:33:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:33:36,558 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:33:36,559 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:33:37,007 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-04 11:33:37,030 INFO L? ?]: Removed 367 outVars from TransFormulas that were not future-live. [2025-03-04 11:33:37,030 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:33:37,039 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:33:37,039 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:33:37,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:37 BoogieIcfgContainer [2025-03-04 11:33:37,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:33:37,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:33:37,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:33:37,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:33:37,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:33:36" (1/3) ... [2025-03-04 11:33:37,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527a5309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:33:37, skipping insertion in model container [2025-03-04 11:33:37,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:33:36" (2/3) ... [2025-03-04 11:33:37,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527a5309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:33:37, skipping insertion in model container [2025-03-04 11:33:37,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:33:37" (3/3) ... [2025-03-04 11:33:37,046 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps5.c [2025-03-04 11:33:37,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:33:37,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps5.c that has 3 procedures, 193 locations, 1 initial locations, 0 loop locations, and 84 error locations. [2025-03-04 11:33:37,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:33:37,100 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;@3fcf8af5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:33:37,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-03-04 11:33:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 101 states have (on average 1.8613861386138615) internal successors, (188), 186 states have internal predecessors, (188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:33:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:33:37,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:37,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:33:37,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_25_to_33_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:37,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2111692041, now seen corresponding path program 1 times [2025-03-04 11:33:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:37,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367001123] [2025-03-04 11:33:37,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:37,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:33:37,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:33:37,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:37,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:37,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:37,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367001123] [2025-03-04 11:33:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367001123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627006396] [2025-03-04 11:33:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:37,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:37,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:37,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:37,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:37,465 INFO L87 Difference]: Start difference. First operand has 193 states, 101 states have (on average 1.8613861386138615) internal successors, (188), 186 states have internal predecessors, (188), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:37,782 INFO L93 Difference]: Finished difference Result 530 states and 560 transitions. [2025-03-04 11:33:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:33:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:37,791 INFO L225 Difference]: With dead ends: 530 [2025-03-04 11:33:37,791 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 11:33:37,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:37,797 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 264 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:37,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 728 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 11:33:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 227. [2025-03-04 11:33:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 219 states have internal predecessors, (244), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 255 transitions. [2025-03-04 11:33:37,848 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 255 transitions. Word has length 6 [2025-03-04 11:33:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:37,849 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 255 transitions. [2025-03-04 11:33:37,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 255 transitions. [2025-03-04 11:33:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:33:37,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:37,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:37,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:33:37,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_25_to_33_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1583308083, now seen corresponding path program 1 times [2025-03-04 11:33:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:37,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285407539] [2025-03-04 11:33:37,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:37,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:37,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:33:37,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:33:37,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:37,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285407539] [2025-03-04 11:33:38,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285407539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:38,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036651199] [2025-03-04 11:33:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:38,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:38,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:38,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:38,052 INFO L87 Difference]: Start difference. First operand 227 states and 255 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:38,278 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2025-03-04 11:33:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:38,278 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 11:33:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:38,280 INFO L225 Difference]: With dead ends: 334 [2025-03-04 11:33:38,281 INFO L226 Difference]: Without dead ends: 326 [2025-03-04 11:33:38,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:38,281 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 220 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:38,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 694 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-04 11:33:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 227. [2025-03-04 11:33:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.7481481481481482) internal successors, (236), 219 states have internal predecessors, (236), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2025-03-04 11:33:38,291 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 16 [2025-03-04 11:33:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:38,291 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2025-03-04 11:33:38,291 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2025-03-04 11:33:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:33:38,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:38,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:38,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:33:38,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_25_to_33_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:38,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2014968901, now seen corresponding path program 1 times [2025-03-04 11:33:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:38,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784809428] [2025-03-04 11:33:38,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:38,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:33:38,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:33:38,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:38,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:38,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57721679] [2025-03-04 11:33:38,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:38,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:38,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:38,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:33:38,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:33:38,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:33:38,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:38,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:38,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:33:38,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:38,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:33:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:38,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784809428] [2025-03-04 11:33:38,519 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57721679] [2025-03-04 11:33:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57721679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917822864] [2025-03-04 11:33:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:38,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:38,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:38,522 INFO L87 Difference]: Start difference. First operand 227 states and 247 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:38,729 INFO L93 Difference]: Finished difference Result 326 states and 331 transitions. [2025-03-04 11:33:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:38,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-04 11:33:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:38,730 INFO L225 Difference]: With dead ends: 326 [2025-03-04 11:33:38,731 INFO L226 Difference]: Without dead ends: 324 [2025-03-04 11:33:38,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:38,731 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 202 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:38,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 839 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-04 11:33:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 227. [2025-03-04 11:33:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.7333333333333334) internal successors, (234), 219 states have internal predecessors, (234), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 245 transitions. [2025-03-04 11:33:38,746 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 245 transitions. Word has length 24 [2025-03-04 11:33:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:38,746 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 245 transitions. [2025-03-04 11:33:38,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 245 transitions. [2025-03-04 11:33:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:33:38,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:38,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:38,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:33:38,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:38,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_33_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:38,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -645135709, now seen corresponding path program 1 times [2025-03-04 11:33:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:38,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605563468] [2025-03-04 11:33:38,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:38,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:33:38,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:33:38,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:38,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:39,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:39,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605563468] [2025-03-04 11:33:39,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605563468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:39,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:39,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448910427] [2025-03-04 11:33:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:39,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:39,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:39,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:39,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:39,103 INFO L87 Difference]: Start difference. First operand 227 states and 245 transitions. Second operand has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:39,277 INFO L93 Difference]: Finished difference Result 324 states and 329 transitions. [2025-03-04 11:33:39,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:39,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-04 11:33:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:39,279 INFO L225 Difference]: With dead ends: 324 [2025-03-04 11:33:39,279 INFO L226 Difference]: Without dead ends: 318 [2025-03-04 11:33:39,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:39,279 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 178 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:39,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 706 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-04 11:33:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 227. [2025-03-04 11:33:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.6888888888888889) internal successors, (228), 219 states have internal predecessors, (228), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 239 transitions. [2025-03-04 11:33:39,295 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 239 transitions. Word has length 26 [2025-03-04 11:33:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:39,295 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 239 transitions. [2025-03-04 11:33:39,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 239 transitions. [2025-03-04 11:33:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:33:39,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:39,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:39,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:33:39,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_25_to_33_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:39,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash 663836093, now seen corresponding path program 1 times [2025-03-04 11:33:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-03-04 11:33:39,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:39,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:33:39,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:33:39,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:39,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:39,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19380805] [2025-03-04 11:33:39,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:39,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:39,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:33:39,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:33:39,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:33:39,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:39,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:39,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:33:39,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:39,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:33:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:39,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:39,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:39,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923784749] [2025-03-04 11:33:39,525 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:39,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19380805] [2025-03-04 11:33:39,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19380805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:39,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:39,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:33:39,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710550749] [2025-03-04 11:33:39,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:39,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:33:39,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:39,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:33:39,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:39,526 INFO L87 Difference]: Start difference. First operand 227 states and 239 transitions. Second operand has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:39,730 INFO L93 Difference]: Finished difference Result 318 states and 323 transitions. [2025-03-04 11:33:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:33:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 11:33:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:39,731 INFO L225 Difference]: With dead ends: 318 [2025-03-04 11:33:39,731 INFO L226 Difference]: Without dead ends: 316 [2025-03-04 11:33:39,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:33:39,732 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 190 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:39,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 718 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-04 11:33:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 227. [2025-03-04 11:33:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.674074074074074) internal successors, (226), 219 states have internal predecessors, (226), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 237 transitions. [2025-03-04 11:33:39,741 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 237 transitions. Word has length 32 [2025-03-04 11:33:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:39,741 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 237 transitions. [2025-03-04 11:33:39,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 237 transitions. [2025-03-04 11:33:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:33:39,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:39,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:39,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:39,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:39,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_25_to_33_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:39,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2003641317, now seen corresponding path program 1 times [2025-03-04 11:33:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732734828] [2025-03-04 11:33:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:39,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:33:39,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:33:39,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:39,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:40,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732734828] [2025-03-04 11:33:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732734828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:40,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:40,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510377359] [2025-03-04 11:33:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:40,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:40,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:40,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:40,118 INFO L87 Difference]: Start difference. First operand 227 states and 237 transitions. Second operand has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:40,201 INFO L93 Difference]: Finished difference Result 314 states and 318 transitions. [2025-03-04 11:33:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:40,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-04 11:33:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:40,202 INFO L225 Difference]: With dead ends: 314 [2025-03-04 11:33:40,203 INFO L226 Difference]: Without dead ends: 312 [2025-03-04 11:33:40,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:40,203 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 167 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:40,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 866 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-04 11:33:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 227. [2025-03-04 11:33:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.6592592592592592) internal successors, (224), 219 states have internal predecessors, (224), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 235 transitions. [2025-03-04 11:33:40,209 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 235 transitions. Word has length 34 [2025-03-04 11:33:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:40,209 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 235 transitions. [2025-03-04 11:33:40,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 235 transitions. [2025-03-04 11:33:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:33:40,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:40,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:40,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:33:40,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_25_to_33_0Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:40,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1353956743, now seen corresponding path program 1 times [2025-03-04 11:33:40,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:40,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173328360] [2025-03-04 11:33:40,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:40,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:33:40,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:33:40,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:40,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:40,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:40,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173328360] [2025-03-04 11:33:40,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173328360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:40,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:40,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969130123] [2025-03-04 11:33:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:40,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:40,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:40,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:40,396 INFO L87 Difference]: Start difference. First operand 227 states and 235 transitions. Second operand has 7 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:40,834 INFO L93 Difference]: Finished difference Result 312 states and 316 transitions. [2025-03-04 11:33:40,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:40,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 11:33:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:40,835 INFO L225 Difference]: With dead ends: 312 [2025-03-04 11:33:40,835 INFO L226 Difference]: Without dead ends: 311 [2025-03-04 11:33:40,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:40,836 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 170 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:40,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 837 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:33:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-04 11:33:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 227. [2025-03-04 11:33:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.651851851851852) internal successors, (223), 219 states have internal predecessors, (223), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 234 transitions. [2025-03-04 11:33:40,844 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 234 transitions. Word has length 36 [2025-03-04 11:33:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:40,844 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 234 transitions. [2025-03-04 11:33:40,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 234 transitions. [2025-03-04 11:33:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 11:33:40,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:40,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:40,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:33:40,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_25_to_33_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 977013932, now seen corresponding path program 1 times [2025-03-04 11:33:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:40,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712258551] [2025-03-04 11:33:40,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:40,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 11:33:40,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 11:33:40,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:40,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712258551] [2025-03-04 11:33:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712258551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:41,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:41,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:41,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107999919] [2025-03-04 11:33:41,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:41,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:41,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:41,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:41,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:41,011 INFO L87 Difference]: Start difference. First operand 227 states and 234 transitions. Second operand has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:41,259 INFO L93 Difference]: Finished difference Result 311 states and 315 transitions. [2025-03-04 11:33:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:41,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-04 11:33:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:41,261 INFO L225 Difference]: With dead ends: 311 [2025-03-04 11:33:41,261 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 11:33:41,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:41,262 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 160 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:41,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 814 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 11:33:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 227. [2025-03-04 11:33:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.6444444444444444) internal successors, (222), 219 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 233 transitions. [2025-03-04 11:33:41,270 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 233 transitions. Word has length 37 [2025-03-04 11:33:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:41,271 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 233 transitions. [2025-03-04 11:33:41,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 233 transitions. [2025-03-04 11:33:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 11:33:41,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:41,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:41,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:33:41,274 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_25_to_33_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:41,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash 222660823, now seen corresponding path program 1 times [2025-03-04 11:33:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417475484] [2025-03-04 11:33:41,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:41,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:33:41,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:33:41,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:41,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:41,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:41,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417475484] [2025-03-04 11:33:41,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417475484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:41,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:41,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925952181] [2025-03-04 11:33:41,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:41,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:41,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:41,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:41,441 INFO L87 Difference]: Start difference. First operand 227 states and 233 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:41,770 INFO L93 Difference]: Finished difference Result 312 states and 317 transitions. [2025-03-04 11:33:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:41,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 11:33:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:41,772 INFO L225 Difference]: With dead ends: 312 [2025-03-04 11:33:41,772 INFO L226 Difference]: Without dead ends: 311 [2025-03-04 11:33:41,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:41,772 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 138 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:41,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 787 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:33:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-04 11:33:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 227. [2025-03-04 11:33:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.637037037037037) internal successors, (221), 219 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 232 transitions. [2025-03-04 11:33:41,780 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 232 transitions. Word has length 38 [2025-03-04 11:33:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:41,780 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 232 transitions. [2025-03-04 11:33:41,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 232 transitions. [2025-03-04 11:33:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 11:33:41,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:41,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:41,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:33:41,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_25_to_33_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:41,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1687449078, now seen corresponding path program 1 times [2025-03-04 11:33:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777499349] [2025-03-04 11:33:41,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:41,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 11:33:41,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 11:33:41,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:41,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:41,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:41,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777499349] [2025-03-04 11:33:41,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777499349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:41,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:41,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:41,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264901761] [2025-03-04 11:33:41,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:41,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:41,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:41,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:41,899 INFO L87 Difference]: Start difference. First operand 227 states and 232 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:42,115 INFO L93 Difference]: Finished difference Result 311 states and 316 transitions. [2025-03-04 11:33:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:42,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-04 11:33:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:42,116 INFO L225 Difference]: With dead ends: 311 [2025-03-04 11:33:42,117 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 11:33:42,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:42,117 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 135 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:42,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 697 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 11:33:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 227. [2025-03-04 11:33:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 135 states have (on average 1.6296296296296295) internal successors, (220), 219 states have internal predecessors, (220), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2025-03-04 11:33:42,123 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 39 [2025-03-04 11:33:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:42,123 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2025-03-04 11:33:42,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:33:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2025-03-04 11:33:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:33:42,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:42,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:42,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:33:42,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_33_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:42,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1615069512, now seen corresponding path program 1 times [2025-03-04 11:33:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:42,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980326773] [2025-03-04 11:33:42,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:42,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:33:42,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:33:42,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:42,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:42,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:42,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980326773] [2025-03-04 11:33:42,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980326773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:42,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:42,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:42,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033454757] [2025-03-04 11:33:42,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:42,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:42,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:42,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:42,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:42,277 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:42,339 INFO L93 Difference]: Finished difference Result 310 states and 314 transitions. [2025-03-04 11:33:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:42,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 11:33:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:42,341 INFO L225 Difference]: With dead ends: 310 [2025-03-04 11:33:42,341 INFO L226 Difference]: Without dead ends: 309 [2025-03-04 11:33:42,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:42,341 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 125 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:42,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 925 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:42,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-03-04 11:33:42,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 228. [2025-03-04 11:33:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 136 states have (on average 1.625) internal successors, (221), 220 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 232 transitions. [2025-03-04 11:33:42,348 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 232 transitions. Word has length 47 [2025-03-04 11:33:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:42,348 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 232 transitions. [2025-03-04 11:33:42,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2025-03-04 11:33:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:33:42,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:42,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:42,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:33:42,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_25_to_33_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1472452671, now seen corresponding path program 1 times [2025-03-04 11:33:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-03-04 11:33:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:42,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:33:42,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:33:42,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:42,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:42,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:42,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968548857] [2025-03-04 11:33:42,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968548857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:42,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:42,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:33:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912618994] [2025-03-04 11:33:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:42,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:33:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:42,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:33:42,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:33:42,490 INFO L87 Difference]: Start difference. First operand 228 states and 232 transitions. Second operand has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:42,548 INFO L93 Difference]: Finished difference Result 309 states and 313 transitions. [2025-03-04 11:33:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:33:42,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 11:33:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:42,550 INFO L225 Difference]: With dead ends: 309 [2025-03-04 11:33:42,550 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 11:33:42,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:42,550 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 122 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:42,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 927 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:33:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 11:33:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 229. [2025-03-04 11:33:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 221 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2025-03-04 11:33:42,558 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 48 [2025-03-04 11:33:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:42,558 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2025-03-04 11:33:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2025-03-04 11:33:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:33:42,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:42,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:42,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:33:42,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_25_to_33_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:42,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:42,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1598607466, now seen corresponding path program 1 times [2025-03-04 11:33:42,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:42,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571889627] [2025-03-04 11:33:42,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:42,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:42,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:33:42,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:33:42,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:42,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:42,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:42,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571889627] [2025-03-04 11:33:42,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571889627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:42,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:42,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:33:42,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875934197] [2025-03-04 11:33:42,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:42,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:33:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:42,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:33:42,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:42,680 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand has 6 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:42,800 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2025-03-04 11:33:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:33:42,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 11:33:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:42,801 INFO L225 Difference]: With dead ends: 308 [2025-03-04 11:33:42,802 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 11:33:42,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:42,802 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 121 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:42,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 753 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:33:42,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 11:33:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 231. [2025-03-04 11:33:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 139 states have (on average 1.6115107913669064) internal successors, (224), 223 states have internal predecessors, (224), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:33:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2025-03-04 11:33:42,808 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 49 [2025-03-04 11:33:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2025-03-04 11:33:42,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2025-03-04 11:33:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:33:42,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:42,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:42,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:33:42,809 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:42,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:42,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1983465669, now seen corresponding path program 1 times [2025-03-04 11:33:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:42,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737804021] [2025-03-04 11:33:42,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:42,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:33:42,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:33:42,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:42,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:42,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737804021] [2025-03-04 11:33:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737804021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:42,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:42,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:33:42,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924394248] [2025-03-04 11:33:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:42,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:33:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:42,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:33:42,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:33:42,911 INFO L87 Difference]: Start difference. First operand 231 states and 235 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:43,078 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2025-03-04 11:33:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:33:43,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-03-04 11:33:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:43,080 INFO L225 Difference]: With dead ends: 308 [2025-03-04 11:33:43,081 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 11:33:43,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:33:43,081 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 158 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:43,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 464 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 11:33:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 244. [2025-03-04 11:33:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 151 states have (on average 1.5629139072847682) internal successors, (236), 234 states have internal predecessors, (236), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 11:33:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 248 transitions. [2025-03-04 11:33:43,088 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 248 transitions. Word has length 50 [2025-03-04 11:33:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:43,088 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 248 transitions. [2025-03-04 11:33:43,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:33:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2025-03-04 11:33:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:33:43,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:43,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:43,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:33:43,089 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_25_to_33_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:43,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:43,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1336516724, now seen corresponding path program 1 times [2025-03-04 11:33:43,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:43,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813859726] [2025-03-04 11:33:43,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:43,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:43,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:33:43,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:33:43,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:43,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:43,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107044968] [2025-03-04 11:33:43,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:43,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:43,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:43,111 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:43,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:33:43,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:33:43,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:33:43,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:43,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:43,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:33:43,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:43,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:33:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:43,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813859726] [2025-03-04 11:33:43,309 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107044968] [2025-03-04 11:33:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107044968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:33:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920541131] [2025-03-04 11:33:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:43,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:33:43,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:43,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:33:43,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:43,310 INFO L87 Difference]: Start difference. First operand 244 states and 248 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:43,540 INFO L93 Difference]: Finished difference Result 315 states and 325 transitions. [2025-03-04 11:33:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:33:43,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-04 11:33:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:43,541 INFO L225 Difference]: With dead ends: 315 [2025-03-04 11:33:43,541 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 11:33:43,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:43,542 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 119 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:43,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 849 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 11:33:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 274. [2025-03-04 11:33:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 179 states have (on average 1.6089385474860336) internal successors, (288), 263 states have internal predecessors, (288), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:33:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2025-03-04 11:33:43,549 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 51 [2025-03-04 11:33:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:43,549 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2025-03-04 11:33:43,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:43,550 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2025-03-04 11:33:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:33:43,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:43,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:43,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:33:43,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:43,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_25_to_33_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1517654533, now seen corresponding path program 1 times [2025-03-04 11:33:43,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:43,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004065338] [2025-03-04 11:33:43,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:43,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:43,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:33:43,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:33:43,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:43,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:43,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340729308] [2025-03-04 11:33:43,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:43,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:43,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:33:43,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:33:43,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:33:43,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:43,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:43,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 11:33:43,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:43,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:33:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:43,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:43,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004065338] [2025-03-04 11:33:43,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:43,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340729308] [2025-03-04 11:33:43,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340729308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:43,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:43,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:33:43,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778622264] [2025-03-04 11:33:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:43,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:33:43,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:43,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:33:43,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:33:43,977 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand has 8 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:44,221 INFO L93 Difference]: Finished difference Result 315 states and 324 transitions. [2025-03-04 11:33:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:33:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-04 11:33:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:44,223 INFO L225 Difference]: With dead ends: 315 [2025-03-04 11:33:44,223 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 11:33:44,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:44,223 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 118 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:44,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 878 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 11:33:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 275. [2025-03-04 11:33:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 180 states have (on average 1.6055555555555556) internal successors, (289), 264 states have internal predecessors, (289), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:33:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 303 transitions. [2025-03-04 11:33:44,231 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 303 transitions. Word has length 52 [2025-03-04 11:33:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:44,231 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 303 transitions. [2025-03-04 11:33:44,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 303 transitions. [2025-03-04 11:33:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 11:33:44,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:44,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:44,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:44,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:33:44,436 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_33_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:44,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 197349714, now seen corresponding path program 1 times [2025-03-04 11:33:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417465964] [2025-03-04 11:33:44,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:44,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:44,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:33:44,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:33:44,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:44,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707406160] [2025-03-04 11:33:44,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:44,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:44,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:44,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:44,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:33:44,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 11:33:44,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 11:33:44,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:44,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:44,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:33:44,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:33:44,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:44,688 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 29 treesize of output 13 [2025-03-04 11:33:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:44,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:44,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417465964] [2025-03-04 11:33:44,702 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707406160] [2025-03-04 11:33:44,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707406160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:44,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:33:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176600428] [2025-03-04 11:33:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:44,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:33:44,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:44,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:33:44,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:33:44,704 INFO L87 Difference]: Start difference. First operand 275 states and 303 transitions. Second operand has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:44,946 INFO L93 Difference]: Finished difference Result 315 states and 323 transitions. [2025-03-04 11:33:44,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:33:44,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2025-03-04 11:33:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:44,948 INFO L225 Difference]: With dead ends: 315 [2025-03-04 11:33:44,948 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 11:33:44,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:33:44,948 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 123 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:44,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1016 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 11:33:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 276. [2025-03-04 11:33:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 181 states have (on average 1.6022099447513811) internal successors, (290), 265 states have internal predecessors, (290), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:33:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2025-03-04 11:33:44,954 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 53 [2025-03-04 11:33:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:44,955 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2025-03-04 11:33:44,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2025-03-04 11:33:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:33:44,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:44,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:44,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:45,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:33:45,160 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_25_to_33_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:45,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1822873817, now seen corresponding path program 1 times [2025-03-04 11:33:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:45,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977577074] [2025-03-04 11:33:45,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:45,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:33:45,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:33:45,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:45,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:45,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142428784] [2025-03-04 11:33:45,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:45,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:45,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:45,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:45,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:33:45,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:33:45,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:33:45,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:45,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:45,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 11:33:45,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:45,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 11 treesize of output 7 [2025-03-04 11:33:45,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 11:33:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:45,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977577074] [2025-03-04 11:33:45,384 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142428784] [2025-03-04 11:33:45,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142428784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:45,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:45,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:33:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836513397] [2025-03-04 11:33:45,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:45,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:33:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:45,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:33:45,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:33:45,385 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:45,634 INFO L93 Difference]: Finished difference Result 315 states and 322 transitions. [2025-03-04 11:33:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:33:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-04 11:33:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:45,635 INFO L225 Difference]: With dead ends: 315 [2025-03-04 11:33:45,635 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 11:33:45,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:33:45,636 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 122 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:45,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1105 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 11:33:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 277. [2025-03-04 11:33:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 182 states have (on average 1.598901098901099) internal successors, (291), 266 states have internal predecessors, (291), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:33:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 305 transitions. [2025-03-04 11:33:45,646 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 305 transitions. Word has length 54 [2025-03-04 11:33:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:45,646 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 305 transitions. [2025-03-04 11:33:45,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 305 transitions. [2025-03-04 11:33:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:33:45,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:45,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:45,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:45,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:33:45,847 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_25_to_33_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:45,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 674513456, now seen corresponding path program 1 times [2025-03-04 11:33:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209935489] [2025-03-04 11:33:45,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:45,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:33:45,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:33:45,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:45,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:45,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978273542] [2025-03-04 11:33:45,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:45,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:45,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:45,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:45,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:33:45,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:33:45,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:33:45,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:45,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:45,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 11:33:45,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:45,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:33:46,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:33:46,086 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 36 treesize of output 16 [2025-03-04 11:33:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:46,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:46,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209935489] [2025-03-04 11:33:46,104 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978273542] [2025-03-04 11:33:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978273542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:46,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:46,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 11:33:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557025848] [2025-03-04 11:33:46,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:46,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:33:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:46,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:33:46,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:46,105 INFO L87 Difference]: Start difference. First operand 277 states and 305 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:46,372 INFO L93 Difference]: Finished difference Result 315 states and 321 transitions. [2025-03-04 11:33:46,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:33:46,372 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 11:33:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:46,373 INFO L225 Difference]: With dead ends: 315 [2025-03-04 11:33:46,373 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 11:33:46,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:33:46,373 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 123 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:46,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1026 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 11:33:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 278. [2025-03-04 11:33:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 183 states have (on average 1.5956284153005464) internal successors, (292), 267 states have internal predecessors, (292), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:33:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2025-03-04 11:33:46,380 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 55 [2025-03-04 11:33:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:46,381 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2025-03-04 11:33:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2025-03-04 11:33:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:33:46,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:46,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:46,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:33:46,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:46,586 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_25_to_33_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:46,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash -564919369, now seen corresponding path program 1 times [2025-03-04 11:33:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:46,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570191789] [2025-03-04 11:33:46,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:46,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:33:46,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:33:46,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:46,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:33:46,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1434701745] [2025-03-04 11:33:46,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:46,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:46,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:33:46,605 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:33:46,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:33:46,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:33:46,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:33:46,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:46,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:33:46,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:33:46,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:33:46,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:33:46,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 11:33:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:33:46,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:33:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:33:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570191789] [2025-03-04 11:33:46,838 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:33:46,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434701745] [2025-03-04 11:33:46,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434701745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:33:46,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:33:46,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 11:33:46,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91323863] [2025-03-04 11:33:46,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:33:46,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:33:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:33:46,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:33:46,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:33:46,839 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:33:47,049 INFO L93 Difference]: Finished difference Result 315 states and 320 transitions. [2025-03-04 11:33:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:33:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-04 11:33:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:33:47,050 INFO L225 Difference]: With dead ends: 315 [2025-03-04 11:33:47,050 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 11:33:47,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:33:47,051 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 122 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:33:47,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 921 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:33:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 11:33:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279. [2025-03-04 11:33:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 184 states have (on average 1.5923913043478262) internal successors, (293), 268 states have internal predecessors, (293), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 11:33:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2025-03-04 11:33:47,057 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 56 [2025-03-04 11:33:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:33:47,057 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2025-03-04 11:33:47,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:33:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2025-03-04 11:33:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:33:47,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:33:47,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:33:47,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:33:47,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:33:47,260 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_25_to_33_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_25_to_33_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 82 more)] === [2025-03-04 11:33:47,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:33:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash -332631282, now seen corresponding path program 1 times [2025-03-04 11:33:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:33:47,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81659462] [2025-03-04 11:33:47,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:33:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:33:47,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:33:47,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:33:47,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:33:47,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat