./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_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-?-798a7b3-m [2025-03-04 11:31:26,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:31:26,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:31:26,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:31:26,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:31:26,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:31:26,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:31:26,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:31:26,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:31:26,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:31:26,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:31:26,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:31:26,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:31:26,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:31:26,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:31:26,195 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:31:26,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:31:26,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:31:26,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:31:26,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:31:26,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:31:26,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:31:26,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:31:26,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:31:26,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:31:26,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:31:26,196 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-04 11:31:26,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:31:26,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:31:26,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:31:26,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:31:26,423 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:31:26,425 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-04 11:31:27,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de668e496/e18b8d2eeb67416da2db2cdb2d26f9b6/FLAGcad39e76c [2025-03-04 11:31:27,772 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:31:27,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu-ll.c [2025-03-04 11:31:27,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de668e496/e18b8d2eeb67416da2db2cdb2d26f9b6/FLAGcad39e76c [2025-03-04 11:31:28,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de668e496/e18b8d2eeb67416da2db2cdb2d26f9b6 [2025-03-04 11:31:28,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:31:28,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:31:28,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:31:28,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:31:28,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:31:28,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a912dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28, skipping insertion in model container [2025-03-04 11:31:28,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:31:28,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:31:28,277 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:31:28,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:31:28,322 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:31:28,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28 WrapperNode [2025-03-04 11:31:28,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:31:28,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:31:28,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:31:28,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:31:28,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,362 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2025-03-04 11:31:28,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:31:28,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:31:28,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:31:28,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:31:28,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,393 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 12, 5, 11, 15, 21]. 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, 2, 1, 2, 2, 2]. [2025-03-04 11:31:28,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:31:28,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:31:28,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:31:28,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:31:28,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (1/1) ... [2025-03-04 11:31:28,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:31:28,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:28,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:31:28,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:31:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_29_to_41_0 [2025-03-04 11:31:28,459 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_29_to_41_0 [2025-03-04 11:31:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:31:28,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:31:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:31:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:31:28,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:31:28,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:31:28,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:31:28,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:31:28,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:31:28,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:31:28,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:31:28,552 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:31:28,553 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:31:29,042 INFO L1325 $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-04 11:31:29,081 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2025-03-04 11:31:29,081 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:31:29,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:31:29,093 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:31:29,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:31:29 BoogieIcfgContainer [2025-03-04 11:31:29,094 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:31:29,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:31:29,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:31:29,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:31:29,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:31:28" (1/3) ... [2025-03-04 11:31:29,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d55d1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:31:29, skipping insertion in model container [2025-03-04 11:31:29,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:31:28" (2/3) ... [2025-03-04 11:31:29,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d55d1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:31:29, skipping insertion in model container [2025-03-04 11:31:29,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:31:29" (3/3) ... [2025-03-04 11:31:29,100 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_cohencu-ll.c [2025-03-04 11:31:29,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:31:29,110 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-04 11:31:29,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:31:29,155 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;@7e03710e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:31:29,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-03-04 11:31:29,158 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-04 11:31:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 11:31:29,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:29,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 11:31:29,163 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-04 11:31:29,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:29,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1557033859, now seen corresponding path program 1 times [2025-03-04 11:31:29,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:29,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240935165] [2025-03-04 11:31:29,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:29,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:29,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 11:31:29,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 11:31:29,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:29,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240935165] [2025-03-04 11:31:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240935165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:29,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690537370] [2025-03-04 11:31:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:29,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:29,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:29,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:29,564 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-04 11:31:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:29,754 INFO L93 Difference]: Finished difference Result 738 states and 792 transitions. [2025-03-04 11:31:29,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 11:31:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:29,765 INFO L225 Difference]: With dead ends: 738 [2025-03-04 11:31:29,766 INFO L226 Difference]: Without dead ends: 418 [2025-03-04 11:31:29,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:29,774 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-04 11:31:29,777 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-04 11:31:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-04 11:31:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 371. [2025-03-04 11:31:29,817 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-04 11:31:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2025-03-04 11:31:29,825 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 6 [2025-03-04 11:31:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:29,826 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2025-03-04 11:31:29,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:31:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2025-03-04 11:31:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:31:29,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:29,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:29,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:31:29,828 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-04 11:31:29,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash 527372962, now seen corresponding path program 1 times [2025-03-04 11:31:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:29,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328880686] [2025-03-04 11:31:29,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:29,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:31:29,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:31:29,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:29,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:30,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328880686] [2025-03-04 11:31:30,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328880686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:30,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:30,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763282239] [2025-03-04 11:31:30,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:30,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:30,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:30,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:30,032 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-04 11:31:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:30,167 INFO L93 Difference]: Finished difference Result 418 states and 434 transitions. [2025-03-04 11:31:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:30,168 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-04 11:31:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:30,169 INFO L225 Difference]: With dead ends: 418 [2025-03-04 11:31:30,169 INFO L226 Difference]: Without dead ends: 414 [2025-03-04 11:31:30,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:30,170 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-04 11:31:30,170 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-04 11:31:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-04 11:31:30,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 371. [2025-03-04 11:31:30,191 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-04 11:31:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2025-03-04 11:31:30,193 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 16 [2025-03-04 11:31:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:30,193 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2025-03-04 11:31:30,193 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-04 11:31:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2025-03-04 11:31:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 11:31:30,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:30,194 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-04 11:31:30,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:31:30,195 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-04 11:31:30,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash -693762722, now seen corresponding path program 1 times [2025-03-04 11:31:30,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:30,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084709479] [2025-03-04 11:31:30,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:30,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:31:30,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:31:30,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:30,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084709479] [2025-03-04 11:31:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084709479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:30,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:30,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:30,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869330587] [2025-03-04 11:31:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:30,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:30,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:30,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:30,341 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-04 11:31:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:30,471 INFO L93 Difference]: Finished difference Result 414 states and 430 transitions. [2025-03-04 11:31:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:30,471 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-04 11:31:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:30,473 INFO L225 Difference]: With dead ends: 414 [2025-03-04 11:31:30,473 INFO L226 Difference]: Without dead ends: 412 [2025-03-04 11:31:30,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:30,475 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-04 11:31:30,476 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-04 11:31:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-04 11:31:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 371. [2025-03-04 11:31:30,490 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-04 11:31:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2025-03-04 11:31:30,491 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 20 [2025-03-04 11:31:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:30,491 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2025-03-04 11:31:30,491 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-04 11:31:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2025-03-04 11:31:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 11:31:30,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:30,492 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-04 11:31:30,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:31:30,492 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-04 11:31:30,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash -986042692, now seen corresponding path program 1 times [2025-03-04 11:31:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:30,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519379465] [2025-03-04 11:31:30,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:30,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:30,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 11:31:30,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 11:31:30,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:30,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519379465] [2025-03-04 11:31:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519379465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:30,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:30,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432259928] [2025-03-04 11:31:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:30,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:30,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:30,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:30,639 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-04 11:31:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:30,801 INFO L93 Difference]: Finished difference Result 412 states and 428 transitions. [2025-03-04 11:31:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:30,802 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-04 11:31:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:30,806 INFO L225 Difference]: With dead ends: 412 [2025-03-04 11:31:30,807 INFO L226 Difference]: Without dead ends: 410 [2025-03-04 11:31:30,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:31:30,808 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-04 11:31:30,809 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-04 11:31:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-04 11:31:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2025-03-04 11:31:30,819 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-04 11:31:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 421 transitions. [2025-03-04 11:31:30,820 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 421 transitions. Word has length 22 [2025-03-04 11:31:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:30,820 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 421 transitions. [2025-03-04 11:31:30,820 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-04 11:31:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 421 transitions. [2025-03-04 11:31:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:31:30,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:30,821 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-04 11:31:30,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:31:30,821 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-04 11:31:30,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash -502552313, now seen corresponding path program 1 times [2025-03-04 11:31:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:30,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049229688] [2025-03-04 11:31:30,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:30,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:31:30,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:31:30,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:30,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:31:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049229688] [2025-03-04 11:31:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049229688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:30,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:30,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456063830] [2025-03-04 11:31:30,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:30,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:30,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:30,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:30,976 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-04 11:31:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:31,097 INFO L93 Difference]: Finished difference Result 410 states and 426 transitions. [2025-03-04 11:31:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:31,097 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-04 11:31:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:31,099 INFO L225 Difference]: With dead ends: 410 [2025-03-04 11:31:31,099 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 11:31:31,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:31,100 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-04 11:31:31,100 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-04 11:31:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 11:31:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 371. [2025-03-04 11:31:31,106 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-04 11:31:31,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 419 transitions. [2025-03-04 11:31:31,108 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 419 transitions. Word has length 23 [2025-03-04 11:31:31,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:31,108 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 419 transitions. [2025-03-04 11:31:31,108 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-04 11:31:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 419 transitions. [2025-03-04 11:31:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:31:31,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:31,109 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-04 11:31:31,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:31:31,109 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-04 11:31:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1614887917, now seen corresponding path program 1 times [2025-03-04 11:31:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:31,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504089391] [2025-03-04 11:31:31,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:31,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:31,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:31:31,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:31:31,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:31,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827909912] [2025-03-04 11:31:31,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:31,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:31,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:31:31,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:31:31,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:31:31,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:31,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:31,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:31:31,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:31,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:31,381 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-04 11:31:31,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:31,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504089391] [2025-03-04 11:31:31,382 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:31,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827909912] [2025-03-04 11:31:31,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827909912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:31,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:31,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022955493] [2025-03-04 11:31:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:31,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:31,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:31,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:31,383 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-04 11:31:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:31,547 INFO L93 Difference]: Finished difference Result 590 states and 609 transitions. [2025-03-04 11:31:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:31,547 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-04 11:31:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:31,549 INFO L225 Difference]: With dead ends: 590 [2025-03-04 11:31:31,549 INFO L226 Difference]: Without dead ends: 586 [2025-03-04 11:31:31,550 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-04 11:31:31,550 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-04 11:31:31,550 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-04 11:31:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-04 11:31:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 453. [2025-03-04 11:31:31,558 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-04 11:31:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2025-03-04 11:31:31,560 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 32 [2025-03-04 11:31:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:31,560 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2025-03-04 11:31:31,560 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-04 11:31:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2025-03-04 11:31:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:31:31,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:31,561 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-04 11:31:31,568 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-04 11:31:31,765 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-04 11:31:31,765 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-04 11:31:31,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:31,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1832861348, now seen corresponding path program 1 times [2025-03-04 11:31:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214133538] [2025-03-04 11:31:31,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:31,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:31:31,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:31:31,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:31,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:31,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479751154] [2025-03-04 11:31:31,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:31,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:31,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:31,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:31,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:31:31,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:31:31,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:31:31,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:31,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:31,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 11:31:31,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:31,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:31,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:32,175 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-04 11:31:32,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:32,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:32,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214133538] [2025-03-04 11:31:32,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:32,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479751154] [2025-03-04 11:31:32,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479751154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:32,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:32,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:32,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117638789] [2025-03-04 11:31:32,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:32,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:32,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:32,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:32,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:32,178 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-04 11:31:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:32,461 INFO L93 Difference]: Finished difference Result 594 states and 613 transitions. [2025-03-04 11:31:32,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:32,461 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-04 11:31:32,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:32,464 INFO L225 Difference]: With dead ends: 594 [2025-03-04 11:31:32,464 INFO L226 Difference]: Without dead ends: 593 [2025-03-04 11:31:32,464 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-04 11:31:32,465 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-04 11:31:32,465 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-04 11:31:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-04 11:31:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 453. [2025-03-04 11:31:32,484 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-04 11:31:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 568 transitions. [2025-03-04 11:31:32,487 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 568 transitions. Word has length 42 [2025-03-04 11:31:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:32,488 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 568 transitions. [2025-03-04 11:31:32,488 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-04 11:31:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 568 transitions. [2025-03-04 11:31:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:31:32,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:32,489 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-04 11:31:32,495 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-04 11:31:32,691 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-04 11:31:32,691 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-04 11:31:32,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash 984126987, now seen corresponding path program 1 times [2025-03-04 11:31:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:32,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415861212] [2025-03-04 11:31:32,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:32,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:31:32,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:31:32,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:32,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117422636] [2025-03-04 11:31:32,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:32,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:32,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:32,716 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:32,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:31:32,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:31:32,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:31:32,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:32,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:32,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 11:31:32,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:32,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:32,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:33,058 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-04 11:31:33,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:33,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415861212] [2025-03-04 11:31:33,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117422636] [2025-03-04 11:31:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117422636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:33,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857321243] [2025-03-04 11:31:33,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:33,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:33,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:33,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:33,059 INFO L87 Difference]: Start difference. First operand 453 states and 568 transitions. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-04 11:31:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:33,289 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2025-03-04 11:31:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 43 [2025-03-04 11:31:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:33,291 INFO L225 Difference]: With dead ends: 593 [2025-03-04 11:31:33,291 INFO L226 Difference]: Without dead ends: 592 [2025-03-04 11:31:33,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 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-04 11:31:33,291 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 516 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:33,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1339 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-04 11:31:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 453. [2025-03-04 11:31:33,303 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-04 11:31:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 567 transitions. [2025-03-04 11:31:33,304 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 567 transitions. Word has length 43 [2025-03-04 11:31:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:33,304 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 567 transitions. [2025-03-04 11:31:33,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-04 11:31:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 567 transitions. [2025-03-04 11:31:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:31:33,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:33,307 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-04 11:31:33,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:31:33,507 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-04 11:31:33,507 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-04 11:31:33,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash 443165570, now seen corresponding path program 1 times [2025-03-04 11:31:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799941804] [2025-03-04 11:31:33,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:33,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:31:33,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:31:33,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:33,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:33,668 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-04 11:31:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:33,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799941804] [2025-03-04 11:31:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799941804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:33,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:33,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780251860] [2025-03-04 11:31:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:33,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:33,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:33,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:33,669 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-04 11:31:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:33,820 INFO L93 Difference]: Finished difference Result 560 states and 580 transitions. [2025-03-04 11:31:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:33,821 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-04 11:31:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:33,822 INFO L225 Difference]: With dead ends: 560 [2025-03-04 11:31:33,822 INFO L226 Difference]: Without dead ends: 558 [2025-03-04 11:31:33,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:33,823 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-04 11:31:33,823 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-04 11:31:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-04 11:31:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 453. [2025-03-04 11:31:33,833 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-04 11:31:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 565 transitions. [2025-03-04 11:31:33,835 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 565 transitions. Word has length 44 [2025-03-04 11:31:33,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:33,835 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 565 transitions. [2025-03-04 11:31:33,835 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-04 11:31:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 565 transitions. [2025-03-04 11:31:33,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:31:33,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:33,836 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-04 11:31:33,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:31:33,836 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-04 11:31:33,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 680351840, now seen corresponding path program 1 times [2025-03-04 11:31:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:33,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219463122] [2025-03-04 11:31:33,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:33,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:31:33,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:31:33,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:33,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:33,968 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-04 11:31:33,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:33,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219463122] [2025-03-04 11:31:33,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219463122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:33,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764611288] [2025-03-04 11:31:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:33,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:33,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:33,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:33,969 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-04 11:31:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:34,166 INFO L93 Difference]: Finished difference Result 558 states and 578 transitions. [2025-03-04 11:31:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:34,167 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-04 11:31:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:34,168 INFO L225 Difference]: With dead ends: 558 [2025-03-04 11:31:34,168 INFO L226 Difference]: Without dead ends: 557 [2025-03-04 11:31:34,169 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-04 11:31:34,169 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 309 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:34,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1695 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-04 11:31:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 453. [2025-03-04 11:31:34,177 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-04 11:31:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 564 transitions. [2025-03-04 11:31:34,179 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 564 transitions. Word has length 46 [2025-03-04 11:31:34,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:34,179 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 564 transitions. [2025-03-04 11:31:34,179 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-04 11:31:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 564 transitions. [2025-03-04 11:31:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:31:34,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:34,179 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-04 11:31:34,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:31:34,180 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-04 11:31:34,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash -383929401, now seen corresponding path program 1 times [2025-03-04 11:31:34,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:34,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242820264] [2025-03-04 11:31:34,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:34,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:34,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:31:34,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:31:34,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:34,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:34,301 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-04 11:31:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242820264] [2025-03-04 11:31:34,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242820264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:34,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:34,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:34,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754247214] [2025-03-04 11:31:34,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:34,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:34,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:34,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:34,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:34,302 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-04 11:31:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:34,537 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2025-03-04 11:31:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:34,537 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-04 11:31:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:34,539 INFO L225 Difference]: With dead ends: 557 [2025-03-04 11:31:34,539 INFO L226 Difference]: Without dead ends: 556 [2025-03-04 11:31:34,539 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-04 11:31:34,540 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-04 11:31:34,540 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-04 11:31:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-04 11:31:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2025-03-04 11:31:34,549 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-04 11:31:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 563 transitions. [2025-03-04 11:31:34,550 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 563 transitions. Word has length 47 [2025-03-04 11:31:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:34,551 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 563 transitions. [2025-03-04 11:31:34,551 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-04 11:31:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 563 transitions. [2025-03-04 11:31:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:31:34,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:34,552 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-04 11:31:34,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:31:34,552 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-04 11:31:34,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 983090494, now seen corresponding path program 1 times [2025-03-04 11:31:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233959489] [2025-03-04 11:31:34,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:34,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:31:34,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:31:34,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:34,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:34,666 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-04 11:31:34,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:34,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233959489] [2025-03-04 11:31:34,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233959489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:34,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:34,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:34,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344131542] [2025-03-04 11:31:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:34,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:34,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:34,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:34,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:34,667 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-04 11:31:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:34,808 INFO L93 Difference]: Finished difference Result 568 states and 588 transitions. [2025-03-04 11:31:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:34,808 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-04 11:31:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:34,810 INFO L225 Difference]: With dead ends: 568 [2025-03-04 11:31:34,810 INFO L226 Difference]: Without dead ends: 566 [2025-03-04 11:31:34,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:34,811 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-04 11:31:34,811 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-04 11:31:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-04 11:31:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2025-03-04 11:31:34,821 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-04 11:31:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 561 transitions. [2025-03-04 11:31:34,822 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 561 transitions. Word has length 48 [2025-03-04 11:31:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:34,823 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 561 transitions. [2025-03-04 11:31:34,823 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-04 11:31:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 561 transitions. [2025-03-04 11:31:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:31:34,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:34,823 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-04 11:31:34,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:31:34,823 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-04 11:31:34,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash -142839268, now seen corresponding path program 1 times [2025-03-04 11:31:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:34,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652811441] [2025-03-04 11:31:34,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:34,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:34,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:31:34,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:31:34,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:34,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758135425] [2025-03-04 11:31:34,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:34,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:34,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:34,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:34,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:31:34,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:31:34,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:31:34,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:34,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:34,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 11:31:34,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:34,937 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-04 11:31:34,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:34,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:35,294 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-04 11:31:35,355 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-04 11:31:35,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:35,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:35,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652811441] [2025-03-04 11:31:35,356 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:35,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758135425] [2025-03-04 11:31:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758135425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:35,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:35,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:31:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163078000] [2025-03-04 11:31:35,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:35,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:31:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:35,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:31:35,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:31:35,357 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-04 11:31:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:35,799 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2025-03-04 11:31:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:31:35,799 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-04 11:31:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:35,801 INFO L225 Difference]: With dead ends: 582 [2025-03-04 11:31:35,801 INFO L226 Difference]: Without dead ends: 581 [2025-03-04 11:31:35,801 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-04 11:31:35,801 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 355 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:35,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1951 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:31:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-04 11:31:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 453. [2025-03-04 11:31:35,811 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-04 11:31:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 560 transitions. [2025-03-04 11:31:35,813 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 560 transitions. Word has length 50 [2025-03-04 11:31:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:35,813 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 560 transitions. [2025-03-04 11:31:35,813 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-04 11:31:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 560 transitions. [2025-03-04 11:31:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 11:31:35,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:35,813 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-04 11:31:35,820 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-04 11:31:36,014 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-04 11:31:36,014 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-04 11:31:36,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash -133049981, now seen corresponding path program 1 times [2025-03-04 11:31:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:36,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389392693] [2025-03-04 11:31:36,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:36,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:36,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 11:31:36,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 11:31:36,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:36,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:36,135 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-04 11:31:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389392693] [2025-03-04 11:31:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389392693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:36,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:36,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:36,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948878588] [2025-03-04 11:31:36,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:36,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:36,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:36,137 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-04 11:31:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:36,312 INFO L93 Difference]: Finished difference Result 565 states and 585 transitions. [2025-03-04 11:31:36,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:36,313 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-04 11:31:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:36,314 INFO L225 Difference]: With dead ends: 565 [2025-03-04 11:31:36,314 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 11:31:36,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:36,315 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-04 11:31:36,315 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-04 11:31:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 11:31:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 453. [2025-03-04 11:31:36,324 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-04 11:31:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 559 transitions. [2025-03-04 11:31:36,325 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 559 transitions. Word has length 51 [2025-03-04 11:31:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:36,325 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 559 transitions. [2025-03-04 11:31:36,325 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-04 11:31:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 559 transitions. [2025-03-04 11:31:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:31:36,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:36,326 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-04 11:31:36,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:31:36,326 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-04 11:31:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash 170417914, now seen corresponding path program 1 times [2025-03-04 11:31:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539769245] [2025-03-04 11:31:36,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:36,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:31:36,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:31:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:31:36,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:36,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539769245] [2025-03-04 11:31:36,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539769245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:36,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:36,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752731065] [2025-03-04 11:31:36,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:36,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:36,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:36,448 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-04 11:31:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:36,608 INFO L93 Difference]: Finished difference Result 576 states and 596 transitions. [2025-03-04 11:31:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:36,608 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-04 11:31:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:36,610 INFO L225 Difference]: With dead ends: 576 [2025-03-04 11:31:36,610 INFO L226 Difference]: Without dead ends: 574 [2025-03-04 11:31:36,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:36,611 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-04 11:31:36,611 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-04 11:31:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-04 11:31:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 453. [2025-03-04 11:31:36,619 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-04 11:31:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 557 transitions. [2025-03-04 11:31:36,621 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 557 transitions. Word has length 52 [2025-03-04 11:31:36,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:36,621 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 557 transitions. [2025-03-04 11:31:36,621 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-04 11:31:36,621 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 557 transitions. [2025-03-04 11:31:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:31:36,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:36,621 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-04 11:31:36,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:31:36,622 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-04 11:31:36,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:36,622 INFO L85 PathProgramCache]: Analyzing trace with hash 562858968, now seen corresponding path program 1 times [2025-03-04 11:31:36,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:36,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308191127] [2025-03-04 11:31:36,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:36,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:36,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:31:36,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:31:36,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:36,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:36,748 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-04 11:31:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308191127] [2025-03-04 11:31:36,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308191127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:36,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:36,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481216203] [2025-03-04 11:31:36,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:36,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:36,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:36,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:36,751 INFO L87 Difference]: Start difference. First operand 453 states and 557 transitions. Second operand has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-04 11:31:36,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:36,952 INFO L93 Difference]: Finished difference Result 574 states and 594 transitions. [2025-03-04 11:31:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:36,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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 54 [2025-03-04 11:31:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:36,954 INFO L225 Difference]: With dead ends: 574 [2025-03-04 11:31:36,954 INFO L226 Difference]: Without dead ends: 572 [2025-03-04 11:31:36,954 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-04 11:31:36,955 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 310 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:36,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1461 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-04 11:31:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2025-03-04 11:31:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7647058823529411) internal successors, (510), 427 states have internal predecessors, (510), 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-04 11:31:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 555 transitions. [2025-03-04 11:31:36,966 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 555 transitions. Word has length 54 [2025-03-04 11:31:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:36,967 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 555 transitions. [2025-03-04 11:31:36,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 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-04 11:31:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 555 transitions. [2025-03-04 11:31:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:31:36,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:36,967 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, 1] [2025-03-04 11:31:36,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:31:36,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_29_to_41_0Err22ASSERT_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-04 11:31:36,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:36,968 INFO L85 PathProgramCache]: Analyzing trace with hash 268758847, now seen corresponding path program 1 times [2025-03-04 11:31:36,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:36,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009746854] [2025-03-04 11:31:36,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:36,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:36,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:31:36,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:31:36,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:37,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-04 11:31:37,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009746854] [2025-03-04 11:31:37,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009746854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:37,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:37,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:31:37,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499264911] [2025-03-04 11:31:37,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:37,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:31:37,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:37,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:31:37,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:37,349 INFO L87 Difference]: Start difference. First operand 453 states and 555 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 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-04 11:31:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:37,961 INFO L93 Difference]: Finished difference Result 548 states and 568 transitions. [2025-03-04 11:31:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:31:37,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 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 55 [2025-03-04 11:31:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:37,963 INFO L225 Difference]: With dead ends: 548 [2025-03-04 11:31:37,963 INFO L226 Difference]: Without dead ends: 546 [2025-03-04 11:31:37,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:31:37,964 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 292 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:37,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1797 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:31:37,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-04 11:31:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 453. [2025-03-04 11:31:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7577854671280277) internal successors, (508), 427 states have internal predecessors, (508), 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-04 11:31:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 553 transitions. [2025-03-04 11:31:37,973 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 553 transitions. Word has length 55 [2025-03-04 11:31:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:37,974 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 553 transitions. [2025-03-04 11:31:37,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 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-04 11:31:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 553 transitions. [2025-03-04 11:31:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 11:31:37,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:37,974 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:37,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:31:37,974 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_29_to_41_0Err19ASSERT_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-04 11:31:37,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash 894937261, now seen corresponding path program 1 times [2025-03-04 11:31:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504904572] [2025-03-04 11:31:37,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:37,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 11:31:37,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:31:37,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:37,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468455157] [2025-03-04 11:31:38,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:38,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:38,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:38,002 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:38,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:31:38,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 11:31:38,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 11:31:38,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:38,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:38,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 11:31:38,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:38,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:31:38,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:38,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504904572] [2025-03-04 11:31:38,242 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468455157] [2025-03-04 11:31:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468455157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:38,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:38,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:31:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972690272] [2025-03-04 11:31:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:38,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:31:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:38,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:31:38,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:31:38,243 INFO L87 Difference]: Start difference. First operand 453 states and 553 transitions. Second operand has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:38,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:38,425 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2025-03-04 11:31:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:31:38,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2025-03-04 11:31:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:38,427 INFO L225 Difference]: With dead ends: 582 [2025-03-04 11:31:38,427 INFO L226 Difference]: Without dead ends: 581 [2025-03-04 11:31:38,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:31:38,428 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 314 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:38,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1685 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-04 11:31:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 453. [2025-03-04 11:31:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.754325259515571) internal successors, (507), 427 states have internal predecessors, (507), 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-04 11:31:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 552 transitions. [2025-03-04 11:31:38,437 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 552 transitions. Word has length 64 [2025-03-04 11:31:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:38,437 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 552 transitions. [2025-03-04 11:31:38,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 552 transitions. [2025-03-04 11:31:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:31:38,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:38,438 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:38,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:38,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:31:38,638 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_29_to_41_0Err18ASSERT_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-04 11:31:38,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1973251328, now seen corresponding path program 1 times [2025-03-04 11:31:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:38,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705566175] [2025-03-04 11:31:38,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:38,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:31:38,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:31:38,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:38,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1851695099] [2025-03-04 11:31:38,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:38,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:38,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:38,655 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:38,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:31:38,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:31:38,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:31:38,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:38,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:38,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 11:31:38,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:38,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:38,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:31:39,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705566175] [2025-03-04 11:31:43,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851695099] [2025-03-04 11:31:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851695099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:43,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:31:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2025-03-04 11:31:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998320481] [2025-03-04 11:31:43,624 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:31:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:43,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:31:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=422, Unknown=1, NotChecked=0, Total=506 [2025-03-04 11:31:43,625 INFO L87 Difference]: Start difference. First operand 453 states and 552 transitions. Second operand has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:31:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:44,472 INFO L93 Difference]: Finished difference Result 581 states and 600 transitions. [2025-03-04 11:31:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:31:44,473 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 65 [2025-03-04 11:31:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:44,474 INFO L225 Difference]: With dead ends: 581 [2025-03-04 11:31:44,474 INFO L226 Difference]: Without dead ends: 580 [2025-03-04 11:31:44,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=190, Invalid=801, Unknown=1, NotChecked=0, Total=992 [2025-03-04 11:31:44,475 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 697 mSDsluCounter, 3092 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:44,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 3340 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:31:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-04 11:31:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 453. [2025-03-04 11:31:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7508650519031141) internal successors, (506), 427 states have internal predecessors, (506), 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-04 11:31:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 551 transitions. [2025-03-04 11:31:44,485 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 551 transitions. Word has length 65 [2025-03-04 11:31:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:44,485 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 551 transitions. [2025-03-04 11:31:44,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.111111111111111) internal successors, (56), 16 states have internal predecessors, (56), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:31:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 551 transitions. [2025-03-04 11:31:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:31:44,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:44,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:44,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:31:44,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:44,686 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_29_to_41_0Err17ASSERT_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-04 11:31:44,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1041249035, now seen corresponding path program 1 times [2025-03-04 11:31:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108593534] [2025-03-04 11:31:44,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:44,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:31:44,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:31:44,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:44,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:31:44,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108593534] [2025-03-04 11:31:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108593534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:44,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164192713] [2025-03-04 11:31:44,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:44,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:44,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:44,784 INFO L87 Difference]: Start difference. First operand 453 states and 551 transitions. Second operand has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:44,924 INFO L93 Difference]: Finished difference Result 556 states and 576 transitions. [2025-03-04 11:31:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2025-03-04 11:31:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:44,927 INFO L225 Difference]: With dead ends: 556 [2025-03-04 11:31:44,927 INFO L226 Difference]: Without dead ends: 554 [2025-03-04 11:31:44,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:44,929 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 274 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:44,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1423 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-04 11:31:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 453. [2025-03-04 11:31:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7439446366782008) internal successors, (504), 427 states have internal predecessors, (504), 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-04 11:31:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 549 transitions. [2025-03-04 11:31:44,943 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 549 transitions. Word has length 66 [2025-03-04 11:31:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:44,943 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 549 transitions. [2025-03-04 11:31:44,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 549 transitions. [2025-03-04 11:31:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:31:44,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:44,944 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 11:31:44,944 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_29_to_41_0Err15ASSERT_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-04 11:31:44,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash -87057047, now seen corresponding path program 1 times [2025-03-04 11:31:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650856386] [2025-03-04 11:31:44,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:44,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:31:44,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:31:44,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:44,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164371281] [2025-03-04 11:31:44,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:44,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:44,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:44,965 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:44,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:31:45,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:31:45,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:31:45,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:45,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:45,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 11:31:45,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:45,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:45,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:31:45,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650856386] [2025-03-04 11:31:45,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164371281] [2025-03-04 11:31:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164371281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:31:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859015819] [2025-03-04 11:31:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:45,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:31:45,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:45,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:31:45,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:45,351 INFO L87 Difference]: Start difference. First operand 453 states and 549 transitions. Second operand has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:45,592 INFO L93 Difference]: Finished difference Result 574 states and 593 transitions. [2025-03-04 11:31:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:31:45,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-04 11:31:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:45,594 INFO L225 Difference]: With dead ends: 574 [2025-03-04 11:31:45,594 INFO L226 Difference]: Without dead ends: 572 [2025-03-04 11:31:45,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:31:45,595 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 303 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:45,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1770 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-04 11:31:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 453. [2025-03-04 11:31:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7370242214532872) internal successors, (502), 427 states have internal predecessors, (502), 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-04 11:31:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 547 transitions. [2025-03-04 11:31:45,603 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 547 transitions. Word has length 68 [2025-03-04 11:31:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:45,604 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 547 transitions. [2025-03-04 11:31:45,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 547 transitions. [2025-03-04 11:31:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 11:31:45,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:45,604 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:45,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:45,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:45,809 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_29_to_41_0Err13ASSERT_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-04 11:31:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2057443385, now seen corresponding path program 1 times [2025-03-04 11:31:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192521947] [2025-03-04 11:31:45,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:45,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 11:31:45,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 11:31:45,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:45,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:31:45,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192521947] [2025-03-04 11:31:45,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192521947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:45,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:45,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704313717] [2025-03-04 11:31:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:45,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:45,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:45,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:45,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:45,909 INFO L87 Difference]: Start difference. First operand 453 states and 547 transitions. Second operand has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:46,073 INFO L93 Difference]: Finished difference Result 564 states and 584 transitions. [2025-03-04 11:31:46,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:46,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2025-03-04 11:31:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:46,075 INFO L225 Difference]: With dead ends: 564 [2025-03-04 11:31:46,075 INFO L226 Difference]: Without dead ends: 562 [2025-03-04 11:31:46,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:46,077 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 272 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:46,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1415 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-04 11:31:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 453. [2025-03-04 11:31:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7301038062283738) internal successors, (500), 427 states have internal predecessors, (500), 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-04 11:31:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 545 transitions. [2025-03-04 11:31:46,086 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 545 transitions. Word has length 70 [2025-03-04 11:31:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:46,086 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 545 transitions. [2025-03-04 11:31:46,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 545 transitions. [2025-03-04 11:31:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 11:31:46,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:46,087 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:46,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:31:46,087 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_29_to_41_0Err11ASSERT_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-04 11:31:46,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1518136795, now seen corresponding path program 1 times [2025-03-04 11:31:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:46,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840197828] [2025-03-04 11:31:46,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:46,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 11:31:46,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:31:46,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:46,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:46,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303435023] [2025-03-04 11:31:46,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:46,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:46,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:46,105 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:46,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:31:46,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 11:31:46,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:31:46,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:46,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:46,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 11:31:46,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:46,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:46,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:31:46,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:31:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840197828] [2025-03-04 11:31:46,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:31:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303435023] [2025-03-04 11:31:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303435023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:31:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373795633] [2025-03-04 11:31:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:46,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:31:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:46,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:31:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:31:46,529 INFO L87 Difference]: Start difference. First operand 453 states and 545 transitions. Second operand has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:46,823 INFO L93 Difference]: Finished difference Result 570 states and 589 transitions. [2025-03-04 11:31:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:31:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 72 [2025-03-04 11:31:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:46,824 INFO L225 Difference]: With dead ends: 570 [2025-03-04 11:31:46,824 INFO L226 Difference]: Without dead ends: 566 [2025-03-04 11:31:46,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:31:46,825 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 304 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:46,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1858 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-04 11:31:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2025-03-04 11:31:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7162629757785468) internal successors, (496), 427 states have internal predecessors, (496), 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-04 11:31:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 541 transitions. [2025-03-04 11:31:46,833 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 541 transitions. Word has length 72 [2025-03-04 11:31:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:46,835 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 541 transitions. [2025-03-04 11:31:46,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:31:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 541 transitions. [2025-03-04 11:31:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 11:31:46,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:46,836 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:46,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:47,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 11:31:47,037 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_29_to_41_0Err7ASSERT_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-04 11:31:47,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2071941760, now seen corresponding path program 1 times [2025-03-04 11:31:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:47,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759971475] [2025-03-04 11:31:47,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:47,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 11:31:47,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 11:31:47,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:47,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:47,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:47,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759971475] [2025-03-04 11:31:47,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759971475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:47,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:47,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:47,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869157074] [2025-03-04 11:31:47,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:47,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:47,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:47,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:47,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:47,146 INFO L87 Difference]: Start difference. First operand 453 states and 541 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:31:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:47,227 INFO L93 Difference]: Finished difference Result 457 states and 545 transitions. [2025-03-04 11:31:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:47,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 83 [2025-03-04 11:31:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:47,229 INFO L225 Difference]: With dead ends: 457 [2025-03-04 11:31:47,229 INFO L226 Difference]: Without dead ends: 455 [2025-03-04 11:31:47,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:47,230 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 62 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:47,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1508 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-04 11:31:47,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-03-04 11:31:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 291 states have (on average 1.711340206185567) internal successors, (498), 429 states have internal predecessors, (498), 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-04 11:31:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 543 transitions. [2025-03-04 11:31:47,239 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 543 transitions. Word has length 83 [2025-03-04 11:31:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:47,240 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 543 transitions. [2025-03-04 11:31:47,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:31:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 543 transitions. [2025-03-04 11:31:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 11:31:47,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:47,242 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:47,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 11:31:47,242 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_29_to_41_0Err5ASSERT_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-04 11:31:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1728794530, now seen corresponding path program 1 times [2025-03-04 11:31:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:47,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523672242] [2025-03-04 11:31:47,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 11:31:47,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 11:31:47,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:47,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523672242] [2025-03-04 11:31:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523672242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:47,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:47,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:47,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739579819] [2025-03-04 11:31:47,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:47,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:47,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:47,447 INFO L87 Difference]: Start difference. First operand 455 states and 543 transitions. Second operand has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:31:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:47,591 INFO L93 Difference]: Finished difference Result 532 states and 552 transitions. [2025-03-04 11:31:47,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:47,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-04 11:31:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:47,593 INFO L225 Difference]: With dead ends: 532 [2025-03-04 11:31:47,593 INFO L226 Difference]: Without dead ends: 530 [2025-03-04 11:31:47,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:47,594 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 209 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:47,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1427 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-04 11:31:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 457. [2025-03-04 11:31:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 293 states have (on average 1.7064846416382253) internal successors, (500), 431 states have internal predecessors, (500), 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-04 11:31:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 545 transitions. [2025-03-04 11:31:47,611 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 545 transitions. Word has length 85 [2025-03-04 11:31:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:47,611 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 545 transitions. [2025-03-04 11:31:47,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:31:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 545 transitions. [2025-03-04 11:31:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:31:47,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:47,612 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:47,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 11:31:47,612 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83ASSERT_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-04 11:31:47,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2051233559, now seen corresponding path program 1 times [2025-03-04 11:31:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:47,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130529671] [2025-03-04 11:31:47,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:47,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:31:47,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:31:47,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:47,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130529671] [2025-03-04 11:31:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130529671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:47,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:31:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481019602] [2025-03-04 11:31:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:47,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:31:47,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:31:47,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:31:47,716 INFO L87 Difference]: Start difference. First operand 457 states and 545 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:31:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:47,811 INFO L93 Difference]: Finished difference Result 463 states and 547 transitions. [2025-03-04 11:31:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:31:47,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2025-03-04 11:31:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:47,813 INFO L225 Difference]: With dead ends: 463 [2025-03-04 11:31:47,813 INFO L226 Difference]: Without dead ends: 459 [2025-03-04 11:31:47,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:31:47,814 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 57 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:47,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1049 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-04 11:31:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2025-03-04 11:31:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 294 states have (on average 1.6904761904761905) internal successors, (497), 432 states have internal predecessors, (497), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-04 11:31:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 543 transitions. [2025-03-04 11:31:47,824 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 543 transitions. Word has length 86 [2025-03-04 11:31:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:47,824 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 543 transitions. [2025-03-04 11:31:47,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:31:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 543 transitions. [2025-03-04 11:31:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 11:31:47,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:47,825 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:47,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 11:31:47,825 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting func_to_recursive_line_29_to_41_0Err3ASSERT_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-04 11:31:47,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash 780799548, now seen corresponding path program 1 times [2025-03-04 11:31:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63108597] [2025-03-04 11:31:47,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:47,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 11:31:47,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 11:31:47,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:47,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:48,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63108597] [2025-03-04 11:31:48,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63108597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:48,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:48,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:48,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714370278] [2025-03-04 11:31:48,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:48,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:48,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:48,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:48,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:48,022 INFO L87 Difference]: Start difference. First operand 459 states and 543 transitions. Second operand has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:31:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:48,197 INFO L93 Difference]: Finished difference Result 540 states and 560 transitions. [2025-03-04 11:31:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 87 [2025-03-04 11:31:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:48,200 INFO L225 Difference]: With dead ends: 540 [2025-03-04 11:31:48,200 INFO L226 Difference]: Without dead ends: 538 [2025-03-04 11:31:48,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-04 11:31:48,200 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 215 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:48,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1397 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-04 11:31:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 461. [2025-03-04 11:31:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 296 states have (on average 1.6858108108108107) internal successors, (499), 434 states have internal predecessors, (499), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-04 11:31:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 545 transitions. [2025-03-04 11:31:48,211 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 545 transitions. Word has length 87 [2025-03-04 11:31:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:48,212 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 545 transitions. [2025-03-04 11:31:48,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:31:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 545 transitions. [2025-03-04 11:31:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 11:31:48,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:48,212 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:48,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 11:31:48,213 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting func_to_recursive_line_29_to_41_0Err1ASSERT_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-04 11:31:48,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:48,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1270911974, now seen corresponding path program 1 times [2025-03-04 11:31:48,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:48,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80546104] [2025-03-04 11:31:48,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:48,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 11:31:48,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:31:48,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:48,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:48,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80546104] [2025-03-04 11:31:48,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80546104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:48,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:31:48,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692544851] [2025-03-04 11:31:48,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:48,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:31:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:48,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:31:48,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:31:48,348 INFO L87 Difference]: Start difference. First operand 461 states and 545 transitions. Second operand has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:31:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:48,457 INFO L93 Difference]: Finished difference Result 550 states and 570 transitions. [2025-03-04 11:31:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:31:48,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 89 [2025-03-04 11:31:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:48,459 INFO L225 Difference]: With dead ends: 550 [2025-03-04 11:31:48,459 INFO L226 Difference]: Without dead ends: 548 [2025-03-04 11:31:48,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:31:48,460 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 225 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:48,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1443 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-04 11:31:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 463. [2025-03-04 11:31:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 436 states have internal predecessors, (501), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2025-03-04 11:31:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 547 transitions. [2025-03-04 11:31:48,469 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 547 transitions. Word has length 89 [2025-03-04 11:31:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:48,469 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 547 transitions. [2025-03-04 11:31:48,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 11:31:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 547 transitions. [2025-03-04 11:31:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 11:31:48,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:48,470 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:48,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 11:31:48,470 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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-04 11:31:48,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1848696125, now seen corresponding path program 1 times [2025-03-04 11:31:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:48,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173838322] [2025-03-04 11:31:48,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:48,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:31:48,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:31:48,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:48,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173838322] [2025-03-04 11:31:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173838322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767584966] [2025-03-04 11:31:48,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:48,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:48,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:48,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:31:48,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:31:48,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:31:48,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:48,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:48,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 11:31:48,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:48,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:49,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 11:31:49,060 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-04 11:31:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:49,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767584966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:49,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 17 [2025-03-04 11:31:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947584081] [2025-03-04 11:31:49,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:49,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:31:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:49,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:31:49,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:31:49,219 INFO L87 Difference]: Start difference. First operand 463 states and 547 transitions. Second operand has 18 states, 16 states have (on average 9.0) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 11:31:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:49,571 INFO L93 Difference]: Finished difference Result 673 states and 703 transitions. [2025-03-04 11:31:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:31:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.0) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-04 11:31:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:49,574 INFO L225 Difference]: With dead ends: 673 [2025-03-04 11:31:49,574 INFO L226 Difference]: Without dead ends: 670 [2025-03-04 11:31:49,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:31:49,574 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 906 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:49,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2667 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-04 11:31:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 526. [2025-03-04 11:31:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 355 states have (on average 1.6901408450704225) internal successors, (600), 491 states have internal predecessors, (600), 28 states have call successors, (28), 5 states have call predecessors, (28), 8 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 11:31:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 662 transitions. [2025-03-04 11:31:49,586 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 662 transitions. Word has length 94 [2025-03-04 11:31:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:49,586 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 662 transitions. [2025-03-04 11:31:49,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.0) internal successors, (144), 15 states have internal predecessors, (144), 6 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 11:31:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 662 transitions. [2025-03-04 11:31:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:31:49,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:49,587 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:49,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:31:49,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 11:31:49,792 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting func_to_recursive_line_29_to_41_0Err52ASSERT_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-04 11:31:49,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1475004938, now seen corresponding path program 1 times [2025-03-04 11:31:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064563892] [2025-03-04 11:31:49,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:49,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:49,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:31:49,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:31:49,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:49,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:31:50,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:50,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064563892] [2025-03-04 11:31:50,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064563892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:31:50,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669426716] [2025-03-04 11:31:50,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:50,008 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:50,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:31:50,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:31:50,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:31:50,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:50,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:50,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 11:31:50,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:50,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:50,147 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-04 11:31:50,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 11:31:50,459 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-04 11:31:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:31:50,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:31:50,697 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 23 treesize of output 15 [2025-03-04 11:31:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:31:50,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669426716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:31:50,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:31:50,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 12] total 28 [2025-03-04 11:31:50,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267209367] [2025-03-04 11:31:50,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:31:50,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:31:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:50,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:31:50,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:31:50,756 INFO L87 Difference]: Start difference. First operand 526 states and 662 transitions. Second operand has 29 states, 25 states have (on average 8.16) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-04 11:31:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:51,681 INFO L93 Difference]: Finished difference Result 668 states and 697 transitions. [2025-03-04 11:31:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 11:31:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 8.16) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 95 [2025-03-04 11:31:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:51,684 INFO L225 Difference]: With dead ends: 668 [2025-03-04 11:31:51,684 INFO L226 Difference]: Without dead ends: 665 [2025-03-04 11:31:51,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 163 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=368, Invalid=2082, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 11:31:51,685 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 1548 mSDsluCounter, 4932 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 5201 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:51,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 5201 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:31:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-04 11:31:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 524. [2025-03-04 11:31:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 355 states have (on average 1.6788732394366197) internal successors, (596), 489 states have internal predecessors, (596), 28 states have call successors, (28), 5 states have call predecessors, (28), 8 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 11:31:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 658 transitions. [2025-03-04 11:31:51,698 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 658 transitions. Word has length 95 [2025-03-04 11:31:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:51,698 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 658 transitions. [2025-03-04 11:31:51,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 8.16) internal successors, (204), 24 states have internal predecessors, (204), 10 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-04 11:31:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 658 transitions. [2025-03-04 11:31:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 11:31:51,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:51,699 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:51,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:31:51,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:51,899 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr79ASSERT_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-04 11:31:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1055377989, now seen corresponding path program 1 times [2025-03-04 11:31:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981136708] [2025-03-04 11:31:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:51,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:31:51,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:31:51,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:51,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:31:52,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:52,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981136708] [2025-03-04 11:31:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981136708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:52,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:52,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:31:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478178181] [2025-03-04 11:31:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:52,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:31:52,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:52,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:31:52,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:31:52,024 INFO L87 Difference]: Start difference. First operand 524 states and 658 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:31:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:52,091 INFO L93 Difference]: Finished difference Result 524 states and 658 transitions. [2025-03-04 11:31:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:31:52,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 96 [2025-03-04 11:31:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:52,093 INFO L225 Difference]: With dead ends: 524 [2025-03-04 11:31:52,093 INFO L226 Difference]: Without dead ends: 523 [2025-03-04 11:31:52,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:31:52,095 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 48 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:52,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 850 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:31:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-04 11:31:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-04 11:31:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 355 states have (on average 1.6732394366197183) internal successors, (594), 488 states have internal predecessors, (594), 28 states have call successors, (28), 5 states have call predecessors, (28), 8 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 11:31:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 656 transitions. [2025-03-04 11:31:52,105 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 656 transitions. Word has length 96 [2025-03-04 11:31:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:52,105 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 656 transitions. [2025-03-04 11:31:52,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:31:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 656 transitions. [2025-03-04 11:31:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 11:31:52,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:52,107 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:52,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 11:31:52,107 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr78ASSERT_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-04 11:31:52,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1643020443, now seen corresponding path program 1 times [2025-03-04 11:31:52,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:52,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726647993] [2025-03-04 11:31:52,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:52,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:52,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:31:52,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:31:52,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:52,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:31:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:31:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726647993] [2025-03-04 11:31:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726647993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:31:52,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:31:52,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:31:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064601038] [2025-03-04 11:31:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:31:52,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:31:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:31:52,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:31:52,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:31:52,352 INFO L87 Difference]: Start difference. First operand 523 states and 656 transitions. Second operand has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:31:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:31:52,641 INFO L93 Difference]: Finished difference Result 536 states and 656 transitions. [2025-03-04 11:31:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:31:52,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 97 [2025-03-04 11:31:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:31:52,643 INFO L225 Difference]: With dead ends: 536 [2025-03-04 11:31:52,643 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 11:31:52,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:31:52,644 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 141 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:31:52,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1775 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:31:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 11:31:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 523. [2025-03-04 11:31:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 355 states have (on average 1.6704225352112676) internal successors, (593), 488 states have internal predecessors, (593), 28 states have call successors, (28), 5 states have call predecessors, (28), 8 states have return successors, (34), 29 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-04 11:31:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 655 transitions. [2025-03-04 11:31:52,657 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 655 transitions. Word has length 97 [2025-03-04 11:31:52,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:31:52,659 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 655 transitions. [2025-03-04 11:31:52,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:31:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 655 transitions. [2025-03-04 11:31:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 11:31:52,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:31:52,661 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:31:52,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 11:31:52,662 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr77ASSERT_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-04 11:31:52,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:31:52,662 INFO L85 PathProgramCache]: Analyzing trace with hash 605974083, now seen corresponding path program 1 times [2025-03-04 11:31:52,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:31:52,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959007630] [2025-03-04 11:31:52,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:31:52,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 11:31:52,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 11:31:52,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:52,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:31:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195077883] [2025-03-04 11:31:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:31:52,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:31:52,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:31:52,684 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:31:52,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:31:52,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 11:31:52,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 11:31:52,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:31:52,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:31:52,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 11:31:52,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:31:52,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2025-03-04 11:31:52,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2025-03-04 11:31:52,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2025-03-04 11:31:52,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:31:52,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 11:32:52,748 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 23 treesize of output 15