./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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_cohencu-ll.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 260777f6a7be1f16cc330a008300c11ebdea8f1cf9d8e96a0325274fd8fd5b2a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:44:05,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:44:05,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:44:05,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:44:05,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:44:05,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:44:05,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:44:05,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:44:05,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:44:05,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:44:05,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:44:05,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:44:05,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:44:05,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:44:05,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:44:05,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:44:05,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:44:05,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:44:05,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:44:05,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:44:05,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:44:05,463 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 -> 260777f6a7be1f16cc330a008300c11ebdea8f1cf9d8e96a0325274fd8fd5b2a [2025-03-09 02:44:05,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:44:05,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:44:05,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:44:05,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:44:05,678 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:44:05,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu-ll.c [2025-03-09 02:44:06,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bbc38e72/d8a7033200e64a7aa98b23f9f9432970/FLAGd35eeafe3 [2025-03-09 02:44:06,944 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:44:06,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu-ll.c [2025-03-09 02:44:06,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bbc38e72/d8a7033200e64a7aa98b23f9f9432970/FLAGd35eeafe3 [2025-03-09 02:44:06,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bbc38e72/d8a7033200e64a7aa98b23f9f9432970 [2025-03-09 02:44:06,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:44:06,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:44:06,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:44:06,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:44:06,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:44:06,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:44:06" (1/1) ... [2025-03-09 02:44:06,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f833fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:06, skipping insertion in model container [2025-03-09 02:44:06,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:44:06" (1/1) ... [2025-03-09 02:44:06,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:44:07,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:44:07,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:44:07,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:44:07,139 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:44:07,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07 WrapperNode [2025-03-09 02:44:07,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:44:07,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:44:07,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:44:07,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:44:07,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,165 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2025-03-09 02:44:07,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:44:07,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:44:07,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:44:07,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:44:07,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,184 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 5, 21, 15, 11, 12]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 1, 2, 2, 2, 2]. [2025-03-09 02:44:07,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:44:07,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:44:07,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:44:07,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:44:07,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (1/1) ... [2025-03-09 02:44:07,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:44:07,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:07,239 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-09 02:44:07,241 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-09 02:44:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:44:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:44:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:44:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:44:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:44:07,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:44:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:44:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:44:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:44:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:44:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:44:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:44:07,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_29_to_41_0 [2025-03-09 02:44:07,262 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_29_to_41_0 [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:44:07,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:44:07,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:44:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:44:07,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:44:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:44:07,348 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:44:07,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:44:07,903 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#n~0#1.base, main_~#n~0#1.offset);havoc main_~#n~0#1.base, main_~#n~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#z~0#1.base, main_~#z~0#1.offset);havoc main_~#z~0#1.base, main_~#z~0#1.offset; [2025-03-09 02:44:07,940 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2025-03-09 02:44:07,940 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:44:07,956 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:44:07,956 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:44:07,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:44:07 BoogieIcfgContainer [2025-03-09 02:44:07,956 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:44:07,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:44:07,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:44:07,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:44:07,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:44:06" (1/3) ... [2025-03-09 02:44:07,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9a31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:44:07, skipping insertion in model container [2025-03-09 02:44:07,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:44:07" (2/3) ... [2025-03-09 02:44:07,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9a31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:44:07, skipping insertion in model container [2025-03-09 02:44:07,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:44:07" (3/3) ... [2025-03-09 02:44:07,967 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_cohencu-ll.c [2025-03-09 02:44:07,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:44:07,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_cohencu-ll.c that has 3 procedures, 317 locations, 1 initial locations, 0 loop locations, and 138 error locations. [2025-03-09 02:44:08,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:44:08,041 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;@48b3c30b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:44:08,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-03-09 02:44:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-09 02:44:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:44:08,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:08,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:44:08,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_29_to_41_0Err53ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:08,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1557033859, now seen corresponding path program 1 times [2025-03-09 02:44:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:08,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-09 02:44:08,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:08,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:44:08,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:44:08,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:08,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:08,492 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-09 02:44:08,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:08,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-09 02:44:08,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645510792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:08,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:08,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914185271] [2025-03-09 02:44:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:08,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:08,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:08,513 INFO L87 Difference]: Start difference. First operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:44:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:08,722 INFO L93 Difference]: Finished difference Result 738 states and 792 transitions. [2025-03-09 02:44:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:08,724 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-09 02:44:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:08,730 INFO L225 Difference]: With dead ends: 738 [2025-03-09 02:44:08,730 INFO L226 Difference]: Without dead ends: 418 [2025-03-09 02:44:08,733 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-09 02:44:08,735 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 205 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:08,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1530 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-09 02:44:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 371. [2025-03-09 02:44:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8497652582159625) internal successors, (394), 351 states have internal predecessors, (394), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-09 02:44:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2025-03-09 02:44:08,792 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 6 [2025-03-09 02:44:08,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:08,792 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2025-03-09 02:44:08,792 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-09 02:44:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2025-03-09 02:44:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:44:08,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:08,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:08,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:44:08,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_29_to_41_0Err49ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:08,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:08,795 INFO L85 PathProgramCache]: Analyzing trace with hash 527372962, now seen corresponding path program 1 times [2025-03-09 02:44:08,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:08,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31631869] [2025-03-09 02:44:08,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:08,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:44:08,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:44:08,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:08,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:09,027 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-09 02:44:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31631869] [2025-03-09 02:44:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31631869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:09,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:09,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:09,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246648956] [2025-03-09 02:44:09,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:09,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:09,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:09,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:09,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:09,030 INFO L87 Difference]: Start difference. First operand 371 states and 429 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:44:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:09,198 INFO L93 Difference]: Finished difference Result 418 states and 434 transitions. [2025-03-09 02:44:09,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:09,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-09 02:44:09,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:09,200 INFO L225 Difference]: With dead ends: 418 [2025-03-09 02:44:09,200 INFO L226 Difference]: Without dead ends: 414 [2025-03-09 02:44:09,200 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-09 02:44:09,201 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 200 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:09,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1479 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-09 02:44:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 371. [2025-03-09 02:44:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8309859154929577) internal successors, (390), 351 states have internal predecessors, (390), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-09 02:44:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2025-03-09 02:44:09,220 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 16 [2025-03-09 02:44:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:09,221 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2025-03-09 02:44:09,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:44:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2025-03-09 02:44:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:44:09,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:09,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:09,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:44:09,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_29_to_41_0Err45ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash -693762722, now seen corresponding path program 1 times [2025-03-09 02:44:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:09,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-03-09 02:44:09,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:09,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:44:09,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:44:09,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:09,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:09,381 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-09 02:44:09,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:09,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-03-09 02:44:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691770302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:09,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399166456] [2025-03-09 02:44:09,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:09,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:09,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:09,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:09,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:09,382 INFO L87 Difference]: Start difference. First operand 371 states and 425 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:44:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:09,512 INFO L93 Difference]: Finished difference Result 414 states and 430 transitions. [2025-03-09 02:44:09,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:09,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-09 02:44:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:09,514 INFO L225 Difference]: With dead ends: 414 [2025-03-09 02:44:09,514 INFO L226 Difference]: Without dead ends: 412 [2025-03-09 02:44:09,515 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-09 02:44:09,515 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 186 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:09,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1481 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-09 02:44:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 371. [2025-03-09 02:44:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8215962441314555) internal successors, (388), 351 states have internal predecessors, (388), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-09 02:44:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2025-03-09 02:44:09,534 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 20 [2025-03-09 02:44:09,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:09,534 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2025-03-09 02:44:09,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:44:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2025-03-09 02:44:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 02:44:09,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:09,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:09,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:44:09,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_29_to_41_0Err43ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash -986042692, now seen corresponding path program 1 times [2025-03-09 02:44:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:09,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181163186] [2025-03-09 02:44:09,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:09,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 02:44:09,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 02:44:09,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:09,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:09,693 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-09 02:44:09,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:09,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181163186] [2025-03-09 02:44:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181163186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:09,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221803913] [2025-03-09 02:44:09,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:09,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:09,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:44:09,694 INFO L87 Difference]: Start difference. First operand 371 states and 423 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:44:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:09,850 INFO L93 Difference]: Finished difference Result 412 states and 428 transitions. [2025-03-09 02:44:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:44:09,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-09 02:44:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:09,852 INFO L225 Difference]: With dead ends: 412 [2025-03-09 02:44:09,852 INFO L226 Difference]: Without dead ends: 410 [2025-03-09 02:44:09,852 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-09 02:44:09,853 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 188 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:09,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1549 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-09 02:44:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2025-03-09 02:44:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.812206572769953) internal successors, (386), 351 states have internal predecessors, (386), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-09 02:44:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 421 transitions. [2025-03-09 02:44:09,866 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 421 transitions. Word has length 22 [2025-03-09 02:44:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:09,866 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 421 transitions. [2025-03-09 02:44:09,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:44:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 421 transitions. [2025-03-09 02:44:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:44:09,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:09,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:09,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:44:09,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_29_to_41_0Err42ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:09,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -502552313, now seen corresponding path program 1 times [2025-03-09 02:44:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202581463] [2025-03-09 02:44:09,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:09,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:44:09,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:44:09,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:09,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:09,991 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-09 02:44:09,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:09,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202581463] [2025-03-09 02:44:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202581463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:09,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382622376] [2025-03-09 02:44:09,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:09,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:09,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:09,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:09,993 INFO L87 Difference]: Start difference. First operand 371 states and 421 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:44:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:10,127 INFO L93 Difference]: Finished difference Result 410 states and 426 transitions. [2025-03-09 02:44:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:10,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-09 02:44:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:10,129 INFO L225 Difference]: With dead ends: 410 [2025-03-09 02:44:10,129 INFO L226 Difference]: Without dead ends: 408 [2025-03-09 02:44:10,129 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-09 02:44:10,130 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 175 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:10,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1483 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-09 02:44:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 371. [2025-03-09 02:44:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8028169014084507) internal successors, (384), 351 states have internal predecessors, (384), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-03-09 02:44:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 419 transitions. [2025-03-09 02:44:10,139 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 419 transitions. Word has length 23 [2025-03-09 02:44:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:10,139 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 419 transitions. [2025-03-09 02:44:10,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:44:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 419 transitions. [2025-03-09 02:44:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 02:44:10,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:10,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:10,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:44:10,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_29_to_41_0Err39ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1614887917, now seen corresponding path program 1 times [2025-03-09 02:44:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105729899] [2025-03-09 02:44:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:10,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:10,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:44:10,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:44:10,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:10,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696936172] [2025-03-09 02:44:10,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:10,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:10,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:10,164 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-09 02:44:10,177 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-09 02:44:10,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 02:44:10,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 02:44:10,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:10,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:10,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:44:10,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:10,301 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-09 02:44:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:10,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105729899] [2025-03-09 02:44:10,434 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696936172] [2025-03-09 02:44:10,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696936172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:10,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586145312] [2025-03-09 02:44:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:10,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:10,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:10,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:44:10,435 INFO L87 Difference]: Start difference. First operand 371 states and 419 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:10,620 INFO L93 Difference]: Finished difference Result 590 states and 609 transitions. [2025-03-09 02:44:10,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:44:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-09 02:44:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:10,623 INFO L225 Difference]: With dead ends: 590 [2025-03-09 02:44:10,623 INFO L226 Difference]: Without dead ends: 586 [2025-03-09 02:44:10,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:44:10,624 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 344 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:10,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1768 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-09 02:44:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 453. [2025-03-09 02:44:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8131487889273357) internal successors, (524), 427 states have internal predecessors, (524), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2025-03-09 02:44:10,636 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 32 [2025-03-09 02:44:10,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:10,636 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2025-03-09 02:44:10,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:44:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2025-03-09 02:44:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 02:44:10,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:10,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:10,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:44:10,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 02:44:10,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_29_to_41_0Err35ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:10,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1832861348, now seen corresponding path program 1 times [2025-03-09 02:44:10,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:10,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577503422] [2025-03-09 02:44:10,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:10,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:44:10,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:44:10,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:10,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709791324] [2025-03-09 02:44:10,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:10,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:10,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:10,868 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-09 02:44:10,870 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-09 02:44:10,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:44:10,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:44:10,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:10,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:10,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 02:44:10,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:10,956 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-09 02:44:10,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:11,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:44:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:44:11,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:11,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:11,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577503422] [2025-03-09 02:44:11,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:11,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709791324] [2025-03-09 02:44:11,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709791324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:11,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:11,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:11,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59165396] [2025-03-09 02:44:11,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:11,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:11,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:11,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:11,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:44:11,278 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:11,563 INFO L93 Difference]: Finished difference Result 594 states and 613 transitions. [2025-03-09 02:44:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:44:11,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-09 02:44:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:11,565 INFO L225 Difference]: With dead ends: 594 [2025-03-09 02:44:11,565 INFO L226 Difference]: Without dead ends: 593 [2025-03-09 02:44:11,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:44:11,566 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 361 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:11,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1506 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:44:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-09 02:44:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 453. [2025-03-09 02:44:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8096885813148789) internal successors, (523), 427 states have internal predecessors, (523), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 568 transitions. [2025-03-09 02:44:11,581 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 568 transitions. Word has length 42 [2025-03-09 02:44:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:11,581 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 568 transitions. [2025-03-09 02:44:11,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 568 transitions. [2025-03-09 02:44:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 02:44:11,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:11,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:11,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:44:11,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 02:44:11,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_29_to_41_0Err34ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash 984126987, now seen corresponding path program 1 times [2025-03-09 02:44:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-03-09 02:44:11,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:11,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 02:44:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 02:44:11,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:11,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:11,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197154751] [2025-03-09 02:44:11,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:11,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:11,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:11,814 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-09 02:44:11,816 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-09 02:44:11,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 02:44:11,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 02:44:11,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:11,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:11,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 02:44:11,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:11,914 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-09 02:44:11,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:44:11,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-09 02:44:12,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 02:44:12,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-09 02:44:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:44:12,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:44:12,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-03-09 02:44:12,946 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197154751] [2025-03-09 02:44:12,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197154751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:44:12,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:44:12,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-09 02:44:12,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953154198] [2025-03-09 02:44:12,946 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:44:12,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:44:12,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:12,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:44:12,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:44:12,947 INFO L87 Difference]: Start difference. First operand 453 states and 568 transitions. Second operand has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:13,996 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2025-03-09 02:44:13,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:44:13,996 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-09 02:44:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:13,998 INFO L225 Difference]: With dead ends: 593 [2025-03-09 02:44:13,998 INFO L226 Difference]: Without dead ends: 592 [2025-03-09 02:44:13,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:44:13,999 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 659 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:13,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2473 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:44:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-09 02:44:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 453. [2025-03-09 02:44:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.806228373702422) internal successors, (522), 427 states have internal predecessors, (522), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 567 transitions. [2025-03-09 02:44:14,013 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 567 transitions. Word has length 43 [2025-03-09 02:44:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:14,013 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 567 transitions. [2025-03-09 02:44:14,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:44:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 567 transitions. [2025-03-09 02:44:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:44:14,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:14,014 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:14,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:44:14,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:14,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_29_to_41_0Err33ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:14,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash 443165570, now seen corresponding path program 1 times [2025-03-09 02:44:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:14,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563625523] [2025-03-09 02:44:14,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:14,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:44:14,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:44:14,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:14,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:44:14,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:14,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563625523] [2025-03-09 02:44:14,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563625523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:14,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:14,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:14,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827597032] [2025-03-09 02:44:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:14,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:14,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:14,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:14,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:14,349 INFO L87 Difference]: Start difference. First operand 453 states and 567 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:14,493 INFO L93 Difference]: Finished difference Result 560 states and 580 transitions. [2025-03-09 02:44:14,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:14,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-09 02:44:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:14,495 INFO L225 Difference]: With dead ends: 560 [2025-03-09 02:44:14,496 INFO L226 Difference]: Without dead ends: 558 [2025-03-09 02:44:14,496 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-09 02:44:14,497 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 313 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:14,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1431 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-09 02:44:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 453. [2025-03-09 02:44:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7993079584775087) internal successors, (520), 427 states have internal predecessors, (520), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 565 transitions. [2025-03-09 02:44:14,512 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 565 transitions. Word has length 44 [2025-03-09 02:44:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:14,513 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 565 transitions. [2025-03-09 02:44:14,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 565 transitions. [2025-03-09 02:44:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:44:14,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:14,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:14,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:44:14,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_29_to_41_0Err31ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:14,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash 680351840, now seen corresponding path program 1 times [2025-03-09 02:44:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920229731] [2025-03-09 02:44:14,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:14,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:44:14,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:44:14,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:14,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:44:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:14,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920229731] [2025-03-09 02:44:14,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920229731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:14,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:14,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:44:14,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765130627] [2025-03-09 02:44:14,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:14,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:44:14,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:14,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:44:14,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:44:14,681 INFO L87 Difference]: Start difference. First operand 453 states and 565 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:14,867 INFO L93 Difference]: Finished difference Result 558 states and 578 transitions. [2025-03-09 02:44:14,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:44:14,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-09 02:44:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:14,869 INFO L225 Difference]: With dead ends: 558 [2025-03-09 02:44:14,869 INFO L226 Difference]: Without dead ends: 557 [2025-03-09 02:44:14,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:44:14,869 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 328 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:14,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1483 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-09 02:44:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 453. [2025-03-09 02:44:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7958477508650519) internal successors, (519), 427 states have internal predecessors, (519), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 564 transitions. [2025-03-09 02:44:14,881 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 564 transitions. Word has length 46 [2025-03-09 02:44:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:14,881 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 564 transitions. [2025-03-09 02:44:14,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 564 transitions. [2025-03-09 02:44:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 02:44:14,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:14,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:14,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:44:14,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_29_to_41_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash -383929401, now seen corresponding path program 1 times [2025-03-09 02:44:14,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363702829] [2025-03-09 02:44:14,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:14,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:44:14,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:44:14,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:14,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:44:15,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363702829] [2025-03-09 02:44:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363702829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:15,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:15,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645525518] [2025-03-09 02:44:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:15,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:15,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:15,025 INFO L87 Difference]: Start difference. First operand 453 states and 564 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:15,273 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2025-03-09 02:44:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:15,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-09 02:44:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:15,275 INFO L225 Difference]: With dead ends: 557 [2025-03-09 02:44:15,275 INFO L226 Difference]: Without dead ends: 556 [2025-03-09 02:44:15,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:44:15,276 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 306 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:15,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:44:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-09 02:44:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2025-03-09 02:44:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.792387543252595) internal successors, (518), 427 states have internal predecessors, (518), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 563 transitions. [2025-03-09 02:44:15,287 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 563 transitions. Word has length 47 [2025-03-09 02:44:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:15,287 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 563 transitions. [2025-03-09 02:44:15,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:15,287 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 563 transitions. [2025-03-09 02:44:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 02:44:15,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:15,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:15,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:44:15,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_29_to_41_0Err29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:15,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash 983090494, now seen corresponding path program 1 times [2025-03-09 02:44:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-03-09 02:44:15,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:15,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 02:44:15,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 02:44:15,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:15,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:44:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438969946] [2025-03-09 02:44:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438969946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:15,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:15,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:15,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770405668] [2025-03-09 02:44:15,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:15,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:15,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:15,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:15,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:15,402 INFO L87 Difference]: Start difference. First operand 453 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:15,542 INFO L93 Difference]: Finished difference Result 568 states and 588 transitions. [2025-03-09 02:44:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:15,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-09 02:44:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:15,544 INFO L225 Difference]: With dead ends: 568 [2025-03-09 02:44:15,544 INFO L226 Difference]: Without dead ends: 566 [2025-03-09 02:44:15,545 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-09 02:44:15,545 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 311 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:15,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1423 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-09 02:44:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2025-03-09 02:44:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7854671280276817) internal successors, (516), 427 states have internal predecessors, (516), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 561 transitions. [2025-03-09 02:44:15,556 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 561 transitions. Word has length 48 [2025-03-09 02:44:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:15,557 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 561 transitions. [2025-03-09 02:44:15,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 561 transitions. [2025-03-09 02:44:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:44:15,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:15,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 02:44:15,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_29_to_41_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash -142839268, now seen corresponding path program 1 times [2025-03-09 02:44:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950743274] [2025-03-09 02:44:15,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:15,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:44:15,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:44:15,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:15,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:44:15,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131379455] [2025-03-09 02:44:15,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:15,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:15,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:44:15,574 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-09 02:44:15,576 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-09 02:44:15,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:44:15,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:44:15,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:15,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:15,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-09 02:44:15,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:44:15,655 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-09 02:44:15,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:44:15,671 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-09 02:44:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:44:16,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:44:16,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:16,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950743274] [2025-03-09 02:44:16,017 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:44:16,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131379455] [2025-03-09 02:44:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131379455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:16,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:44:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92022800] [2025-03-09 02:44:16,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:16,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:44:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:16,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:44:16,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:44:16,019 INFO L87 Difference]: Start difference. First operand 453 states and 561 transitions. Second operand has 9 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:16,422 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2025-03-09 02:44:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:44:16,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-09 02:44:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:16,424 INFO L225 Difference]: With dead ends: 582 [2025-03-09 02:44:16,425 INFO L226 Difference]: Without dead ends: 581 [2025-03-09 02:44:16,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:44:16,425 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 505 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:16,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1783 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:44:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-09 02:44:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 453. [2025-03-09 02:44:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.782006920415225) internal successors, (515), 427 states have internal predecessors, (515), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 560 transitions. [2025-03-09 02:44:16,440 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 560 transitions. Word has length 50 [2025-03-09 02:44:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 560 transitions. [2025-03-09 02:44:16,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 560 transitions. [2025-03-09 02:44:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 02:44:16,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:16,443 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:16,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:44:16,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:44:16,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_29_to_41_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:16,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash -133049981, now seen corresponding path program 1 times [2025-03-09 02:44:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442008852] [2025-03-09 02:44:16,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:16,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:44:16,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:44:16,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:16,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:44:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442008852] [2025-03-09 02:44:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442008852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:16,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:16,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:16,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445630939] [2025-03-09 02:44:16,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:16,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:16,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:16,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:16,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:16,767 INFO L87 Difference]: Start difference. First operand 453 states and 560 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:16,940 INFO L93 Difference]: Finished difference Result 565 states and 585 transitions. [2025-03-09 02:44:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:16,941 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-09 02:44:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:16,943 INFO L225 Difference]: With dead ends: 565 [2025-03-09 02:44:16,943 INFO L226 Difference]: Without dead ends: 564 [2025-03-09 02:44:16,943 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-09 02:44:16,944 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 304 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:16,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1416 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-09 02:44:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 453. [2025-03-09 02:44:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.778546712802768) internal successors, (514), 427 states have internal predecessors, (514), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 559 transitions. [2025-03-09 02:44:16,956 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 559 transitions. Word has length 51 [2025-03-09 02:44:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:16,957 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 559 transitions. [2025-03-09 02:44:16,957 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 559 transitions. [2025-03-09 02:44:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 02:44:16,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:16,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:16,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:44:16,959 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_29_to_41_0Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:16,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:16,959 INFO L85 PathProgramCache]: Analyzing trace with hash 170417914, now seen corresponding path program 1 times [2025-03-09 02:44:16,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:16,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523127072] [2025-03-09 02:44:16,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:16,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:16,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 02:44:16,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 02:44:16,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:16,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:44:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:44:17,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:44:17,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523127072] [2025-03-09 02:44:17,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523127072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:44:17,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:44:17,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:44:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519388318] [2025-03-09 02:44:17,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:44:17,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:44:17,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:44:17,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:44:17,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:44:17,073 INFO L87 Difference]: Start difference. First operand 453 states and 559 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:44:17,217 INFO L93 Difference]: Finished difference Result 576 states and 596 transitions. [2025-03-09 02:44:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:44:17,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-09 02:44:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:44:17,219 INFO L225 Difference]: With dead ends: 576 [2025-03-09 02:44:17,219 INFO L226 Difference]: Without dead ends: 574 [2025-03-09 02:44:17,219 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-09 02:44:17,220 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 309 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:44:17,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:44:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-09 02:44:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 453. [2025-03-09 02:44:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7716262975778547) internal successors, (512), 427 states have internal predecessors, (512), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-03-09 02:44:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 557 transitions. [2025-03-09 02:44:17,230 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 557 transitions. Word has length 52 [2025-03-09 02:44:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:44:17,230 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 557 transitions. [2025-03-09 02:44:17,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:44:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 557 transitions. [2025-03-09 02:44:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:44:17,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:44:17,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:44:17,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:44:17,231 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_29_to_41_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_29_to_41_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_29_to_41_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-03-09 02:44:17,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:44:17,232 INFO L85 PathProgramCache]: Analyzing trace with hash 562858968, now seen corresponding path program 1 times [2025-03-09 02:44:17,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:44:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200605007] [2025-03-09 02:44:17,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:44:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:44:17,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:44:17,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:44:17,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:44:17,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat