./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ace794fa35bd3dd49302fe61957917bbb7565f1b1f34293812fc47531868d51 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:36:05,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:36:06,045 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:36:06,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:36:06,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:36:06,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:36:06,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:36:06,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:36:06,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:36:06,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:36:06,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:36:06,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:36:06,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:36:06,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:36:06,084 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:36:06,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:36:06,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:36:06,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:36:06,086 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:36:06,086 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:36:06,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:36:06,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:36:06,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:36:06,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:36:06,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:36:06,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:36:06,087 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:36:06,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:36:06,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:36:06,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:36:06,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:36:06,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:36:06,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:36:06,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:36:06,088 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ace794fa35bd3dd49302fe61957917bbb7565f1b1f34293812fc47531868d51 [2025-02-06 14:36:06,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:36:06,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:36:06,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:36:06,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:36:06,321 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:36:06,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c [2025-02-06 14:36:07,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c04ec1bb1/70cb4032e3ff4b9fa02bdc6be1603ae0/FLAG2908e22b4 [2025-02-06 14:36:07,826 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:36:07,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c [2025-02-06 14:36:07,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c04ec1bb1/70cb4032e3ff4b9fa02bdc6be1603ae0/FLAG2908e22b4 [2025-02-06 14:36:08,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c04ec1bb1/70cb4032e3ff4b9fa02bdc6be1603ae0 [2025-02-06 14:36:08,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:36:08,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:36:08,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:36:08,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:36:08,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:36:08,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4873cad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08, skipping insertion in model container [2025-02-06 14:36:08,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:36:08,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:36:08,234 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:36:08,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:36:08,254 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:36:08,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08 WrapperNode [2025-02-06 14:36:08,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:36:08,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:36:08,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:36:08,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:36:08,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,272 INFO L138 Inliner]: procedures = 16, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-02-06 14:36:08,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:36:08,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:36:08,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:36:08,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:36:08,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,288 INFO L175 MemorySlicer]: Split 29 memory accesses to 6 slices as follows [2, 8, 5, 5, 4, 5]. 28 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, 3, 2, 1, 1, 2]. [2025-02-06 14:36:08,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,296 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:36:08,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:36:08,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:36:08,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:36:08,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (1/1) ... [2025-02-06 14:36:08,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:36:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:08,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:36:08,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:36:08,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_40_0 [2025-02-06 14:36:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_40_0 [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:36:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:36:08,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 14:36:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 14:36:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 14:36:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 14:36:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 14:36:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 14:36:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:36:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:36:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:36:08,421 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:36:08,423 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:36:08,656 INFO L1309 $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_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~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-02-06 14:36:08,681 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-06 14:36:08,684 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:36:08,692 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:36:08,692 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:36:08,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:08 BoogieIcfgContainer [2025-02-06 14:36:08,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:36:08,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:36:08,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:36:08,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:36:08,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:36:08" (1/3) ... [2025-02-06 14:36:08,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4103e2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:08, skipping insertion in model container [2025-02-06 14:36:08,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:08" (2/3) ... [2025-02-06 14:36:08,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4103e2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:08, skipping insertion in model container [2025-02-06 14:36:08,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:08" (3/3) ... [2025-02-06 14:36:08,700 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_prodbin-ll.c [2025-02-06 14:36:08,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:36:08,711 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_prodbin-ll.c that has 3 procedures, 59 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-06 14:36:08,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:36:08,771 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;@57e9d149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:36:08,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-06 14:36:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 53 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 14:36:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:36:08,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:08,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:08,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:08,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:08,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1493839009, now seen corresponding path program 1 times [2025-02-06 14:36:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365891227] [2025-02-06 14:36:08,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:08,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:36:08,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:36:08,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:08,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:08,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:08,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365891227] [2025-02-06 14:36:08,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365891227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:08,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:08,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:36:08,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560505469] [2025-02-06 14:36:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:08,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 14:36:08,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:08,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 14:36:08,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:36:08,946 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 53 states have internal predecessors, (57), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-02-06 14:36:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:08,959 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2025-02-06 14:36:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 14:36:08,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2025-02-06 14:36:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:08,964 INFO L225 Difference]: With dead ends: 114 [2025-02-06 14:36:08,964 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 14:36:08,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 14:36:08,970 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:08,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 14:36:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 14:36:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:36:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-02-06 14:36:08,992 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 8 [2025-02-06 14:36:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:08,992 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-02-06 14:36:08,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-02-06 14:36:08,992 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-02-06 14:36:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:36:08,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:08,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:08,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:36:08,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:08,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1465209858, now seen corresponding path program 1 times [2025-02-06 14:36:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:08,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049117158] [2025-02-06 14:36:08,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:09,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:36:09,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:36:09,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:09,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944708675] [2025-02-06 14:36:09,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:09,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:09,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:09,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:09,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:36:09,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:36:09,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:36:09,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:09,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:09,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 14:36:09,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:09,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:09,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:09,333 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 30 treesize of output 18 [2025-02-06 14:36:09,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:09,348 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 25 treesize of output 17 [2025-02-06 14:36:09,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:09,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 14:36:09,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 14:36:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:09,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:09,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:09,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049117158] [2025-02-06 14:36:09,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:09,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944708675] [2025-02-06 14:36:09,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944708675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:09,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:09,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:36:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119682504] [2025-02-06 14:36:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:09,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:36:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:09,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:36:09,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:36:09,493 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 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-02-06 14:36:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:09,711 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-02-06 14:36:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:09,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 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 8 [2025-02-06 14:36:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:09,712 INFO L225 Difference]: With dead ends: 90 [2025-02-06 14:36:09,712 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 14:36:09,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:36:09,713 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 72 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:09,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 235 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 14:36:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2025-02-06 14:36:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:36:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-02-06 14:36:09,729 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 8 [2025-02-06 14:36:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:09,729 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-02-06 14:36:09,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 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-02-06 14:36:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-02-06 14:36:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 14:36:09,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:09,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:09,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:36:09,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:09,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_0_to_40_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:09,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1823134662, now seen corresponding path program 1 times [2025-02-06 14:36:09,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855858789] [2025-02-06 14:36:09,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:09,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 14:36:09,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 14:36:09,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:09,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:09,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217239495] [2025-02-06 14:36:09,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:09,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:09,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:09,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:09,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:36:10,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 14:36:10,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 14:36:10,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:10,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:10,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 14:36:10,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:10,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:10,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:10,130 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 30 treesize of output 18 [2025-02-06 14:36:10,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:10,140 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-02-06 14:36:10,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:10,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:10,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 14:36:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:10,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:10,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:10,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855858789] [2025-02-06 14:36:10,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:10,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217239495] [2025-02-06 14:36:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217239495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:10,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:10,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:36:10,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831128736] [2025-02-06 14:36:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:10,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:36:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:10,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:36:10,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:36:10,237 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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-02-06 14:36:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:10,400 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-02-06 14:36:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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 9 [2025-02-06 14:36:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:10,401 INFO L225 Difference]: With dead ends: 89 [2025-02-06 14:36:10,401 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 14:36:10,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:36:10,402 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:10,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 239 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 14:36:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2025-02-06 14:36:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 58 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-06 14:36:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-02-06 14:36:10,407 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 9 [2025-02-06 14:36:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:10,408 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-02-06 14:36:10,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 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-02-06 14:36:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-02-06 14:36:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 14:36:10,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:10,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:10,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 14:36:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:10,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_0_to_40_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash 682599676, now seen corresponding path program 1 times [2025-02-06 14:36:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147289075] [2025-02-06 14:36:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:10,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 14:36:10,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 14:36:10,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:10,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147289075] [2025-02-06 14:36:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147289075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214214889] [2025-02-06 14:36:10,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:10,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:10,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:10,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:10,935 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-02-06 14:36:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:11,104 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-02-06 14:36:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:36:11,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 10 [2025-02-06 14:36:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:11,106 INFO L225 Difference]: With dead ends: 102 [2025-02-06 14:36:11,107 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 14:36:11,108 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-02-06 14:36:11,108 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 76 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:11,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 14:36:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2025-02-06 14:36:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 77 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-06 14:36:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2025-02-06 14:36:11,160 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 10 [2025-02-06 14:36:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2025-02-06 14:36:11,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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-02-06 14:36:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2025-02-06 14:36:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 14:36:11,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:11,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:11,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:36:11,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_0_to_40_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:11,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash -314246524, now seen corresponding path program 1 times [2025-02-06 14:36:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:11,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534780359] [2025-02-06 14:36:11,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:11,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 14:36:11,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 14:36:11,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:11,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:11,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:11,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534780359] [2025-02-06 14:36:11,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534780359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:11,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:11,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:11,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359969254] [2025-02-06 14:36:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:11,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:11,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:11,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:11,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:11,337 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-02-06 14:36:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:11,516 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-02-06 14:36:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:36:11,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2025-02-06 14:36:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:11,517 INFO L225 Difference]: With dead ends: 101 [2025-02-06 14:36:11,517 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 14:36:11,517 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-02-06 14:36:11,517 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 67 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:11,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 250 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 14:36:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2025-02-06 14:36:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5) internal successors, (90), 77 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-02-06 14:36:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-02-06 14:36:11,526 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 11 [2025-02-06 14:36:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:11,526 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-02-06 14:36:11,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-02-06 14:36:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-02-06 14:36:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:36:11,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:11,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:11,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:36:11,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_0_to_40_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:11,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1151707654, now seen corresponding path program 1 times [2025-02-06 14:36:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:11,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595521605] [2025-02-06 14:36:11,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:11,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:11,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:36:11,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:36:11,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:11,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1792067287] [2025-02-06 14:36:11,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:11,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:11,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:11,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:11,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:36:11,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:36:11,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:36:11,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:11,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:11,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 14:36:11,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:11,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:11,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:11,647 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 11 [2025-02-06 14:36:11,652 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 11 [2025-02-06 14:36:11,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 19 treesize of output 11 [2025-02-06 14:36:11,702 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 19 treesize of output 11 [2025-02-06 14:36:11,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 14:36:11,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:11,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:11,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595521605] [2025-02-06 14:36:11,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792067287] [2025-02-06 14:36:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792067287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:11,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 14:36:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515977033] [2025-02-06 14:36:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 14:36:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:11,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 14:36:11,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:11,813 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-02-06 14:36:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:12,120 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2025-02-06 14:36:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:36:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 12 [2025-02-06 14:36:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:12,121 INFO L225 Difference]: With dead ends: 121 [2025-02-06 14:36:12,121 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 14:36:12,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:36:12,122 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 93 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:12,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 264 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 14:36:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2025-02-06 14:36:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.56) internal successors, (117), 94 states have internal predecessors, (117), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-06 14:36:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2025-02-06 14:36:12,129 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 12 [2025-02-06 14:36:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:12,130 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2025-02-06 14:36:12,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-02-06 14:36:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2025-02-06 14:36:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 14:36:12,130 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:12,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:12,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 14:36:12,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:12,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_0_to_40_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1343198910, now seen corresponding path program 1 times [2025-02-06 14:36:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350960555] [2025-02-06 14:36:12,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:12,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:12,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 14:36:12,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 14:36:12,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:12,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652830807] [2025-02-06 14:36:12,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:12,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:12,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:12,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:12,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:36:12,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 14:36:12,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 14:36:12,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:12,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 14:36:12,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:12,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:12,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:12,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 14:36:12,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 14:36:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:12,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:36:12,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350960555] [2025-02-06 14:36:12,520 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:36:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652830807] [2025-02-06 14:36:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652830807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:12,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:12,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290977854] [2025-02-06 14:36:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:12,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:12,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:12,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:12,521 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-02-06 14:36:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:12,604 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2025-02-06 14:36:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:36:12,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2025-02-06 14:36:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:12,605 INFO L225 Difference]: With dead ends: 104 [2025-02-06 14:36:12,605 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 14:36:12,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:36:12,606 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 68 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:12,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 173 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 14:36:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-06 14:36:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.52) internal successors, (114), 93 states have internal predecessors, (114), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-06 14:36:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 134 transitions. [2025-02-06 14:36:12,614 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 134 transitions. Word has length 13 [2025-02-06 14:36:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:12,614 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 134 transitions. [2025-02-06 14:36:12,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-02-06 14:36:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 134 transitions. [2025-02-06 14:36:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 14:36:12,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:12,614 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-02-06 14:36:12,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 14:36:12,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 14:36:12,815 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_0_to_40_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:12,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash 53512515, now seen corresponding path program 1 times [2025-02-06 14:36:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:12,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531629429] [2025-02-06 14:36:12,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:12,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 14:36:12,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 14:36:12,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:12,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531629429] [2025-02-06 14:36:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531629429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:13,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:13,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791207000] [2025-02-06 14:36:13,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:13,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:13,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:13,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:13,065 INFO L87 Difference]: Start difference. First operand 103 states and 134 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-02-06 14:36:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:13,150 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2025-02-06 14:36:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:36:13,151 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-02-06 14:36:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:13,151 INFO L225 Difference]: With dead ends: 110 [2025-02-06 14:36:13,151 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 14:36:13,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:13,152 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:13,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 242 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 14:36:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2025-02-06 14:36:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 93 states have internal predecessors, (113), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-06 14:36:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2025-02-06 14:36:13,166 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 22 [2025-02-06 14:36:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:13,166 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2025-02-06 14:36:13,166 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-02-06 14:36:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2025-02-06 14:36:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 14:36:13,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:13,167 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-02-06 14:36:13,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:36:13,167 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_0_to_40_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:13,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:13,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1658887949, now seen corresponding path program 1 times [2025-02-06 14:36:13,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:13,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074372420] [2025-02-06 14:36:13,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:13,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:13,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 14:36:13,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 14:36:13,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:13,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:13,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:13,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074372420] [2025-02-06 14:36:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074372420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:13,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:13,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457743785] [2025-02-06 14:36:13,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:13,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:13,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:13,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:13,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:13,450 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-02-06 14:36:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:13,539 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2025-02-06 14:36:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:36:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-02-06 14:36:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:13,541 INFO L225 Difference]: With dead ends: 109 [2025-02-06 14:36:13,541 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 14:36:13,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:13,542 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:13,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 245 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 14:36:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2025-02-06 14:36:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 93 states have internal predecessors, (112), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-06 14:36:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2025-02-06 14:36:13,552 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 23 [2025-02-06 14:36:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:13,552 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2025-02-06 14:36:13,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-02-06 14:36:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2025-02-06 14:36:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 14:36:13,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:13,553 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-02-06 14:36:13,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:36:13,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_0_to_40_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:13,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1658888686, now seen corresponding path program 1 times [2025-02-06 14:36:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:13,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380130368] [2025-02-06 14:36:13,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:13,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 14:36:13,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 14:36:13,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:13,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:13,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380130368] [2025-02-06 14:36:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380130368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:13,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:13,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405578283] [2025-02-06 14:36:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:13,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:13,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:13,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:13,741 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-02-06 14:36:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:13,818 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2025-02-06 14:36:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:36:13,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-02-06 14:36:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:13,820 INFO L225 Difference]: With dead ends: 114 [2025-02-06 14:36:13,821 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 14:36:13,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:13,821 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:13,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 248 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 14:36:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2025-02-06 14:36:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 93 states have internal predecessors, (110), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-06 14:36:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2025-02-06 14:36:13,831 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 23 [2025-02-06 14:36:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:13,831 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2025-02-06 14:36:13,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 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-02-06 14:36:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2025-02-06 14:36:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 14:36:13,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:13,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:13,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 14:36:13,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:13,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -115188000, now seen corresponding path program 1 times [2025-02-06 14:36:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:13,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385257899] [2025-02-06 14:36:13,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:13,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 14:36:13,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 14:36:13,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:13,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385257899] [2025-02-06 14:36:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385257899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:14,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:14,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 14:36:14,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106617270] [2025-02-06 14:36:14,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:14,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 14:36:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:14,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 14:36:14,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:36:14,091 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:36:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:14,200 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2025-02-06 14:36:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:36:14,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-02-06 14:36:14,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:14,201 INFO L225 Difference]: With dead ends: 121 [2025-02-06 14:36:14,201 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 14:36:14,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:36:14,201 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:14,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 230 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 14:36:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2025-02-06 14:36:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 93 states have internal predecessors, (110), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-06 14:36:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2025-02-06 14:36:14,208 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 24 [2025-02-06 14:36:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:14,208 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2025-02-06 14:36:14,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:36:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2025-02-06 14:36:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 14:36:14,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:14,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:14,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 14:36:14,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_0_to_40_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:14,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash -114081151, now seen corresponding path program 1 times [2025-02-06 14:36:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:14,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947318173] [2025-02-06 14:36:14,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:14,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 14:36:14,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 14:36:14,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:14,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947318173] [2025-02-06 14:36:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947318173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:14,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:14,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:14,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358895763] [2025-02-06 14:36:14,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:14,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:14,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:14,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:14,338 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-06 14:36:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:14,427 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-02-06 14:36:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:36:14,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2025-02-06 14:36:14,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:14,428 INFO L225 Difference]: With dead ends: 110 [2025-02-06 14:36:14,428 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 14:36:14,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:14,429 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:14,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 234 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 14:36:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2025-02-06 14:36:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 93 states have internal predecessors, (109), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-06 14:36:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2025-02-06 14:36:14,435 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 24 [2025-02-06 14:36:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:14,435 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2025-02-06 14:36:14,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-06 14:36:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2025-02-06 14:36:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 14:36:14,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:14,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:14,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 14:36:14,436 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_0_to_40_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash -114058311, now seen corresponding path program 1 times [2025-02-06 14:36:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:14,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192798340] [2025-02-06 14:36:14,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:14,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 14:36:14,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 14:36:14,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:14,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192798340] [2025-02-06 14:36:14,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192798340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:14,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:14,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116114403] [2025-02-06 14:36:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:14,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:14,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:14,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:14,546 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-06 14:36:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:14,607 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2025-02-06 14:36:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:36:14,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 24 [2025-02-06 14:36:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:14,608 INFO L225 Difference]: With dead ends: 107 [2025-02-06 14:36:14,608 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 14:36:14,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:14,609 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 28 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:14,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 255 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 14:36:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 14:36:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 93 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-06 14:36:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 129 transitions. [2025-02-06 14:36:14,619 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 129 transitions. Word has length 24 [2025-02-06 14:36:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:14,619 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 129 transitions. [2025-02-06 14:36:14,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-02-06 14:36:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2025-02-06 14:36:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 14:36:14,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:14,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:14,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 14:36:14,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_0_to_40_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:14,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 758451595, now seen corresponding path program 1 times [2025-02-06 14:36:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54621994] [2025-02-06 14:36:14,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 14:36:14,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 14:36:14,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:14,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54621994] [2025-02-06 14:36:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54621994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:14,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693519585] [2025-02-06 14:36:14,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:14,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:14,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:14,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:14,780 INFO L87 Difference]: Start difference. First operand 105 states and 129 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-02-06 14:36:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:14,881 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2025-02-06 14:36:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:36:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 25 [2025-02-06 14:36:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:14,882 INFO L225 Difference]: With dead ends: 108 [2025-02-06 14:36:14,883 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 14:36:14,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:14,884 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:14,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 237 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 14:36:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-02-06 14:36:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.394736842105263) internal successors, (106), 93 states have internal predecessors, (106), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-06 14:36:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2025-02-06 14:36:14,892 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 25 [2025-02-06 14:36:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:14,892 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2025-02-06 14:36:14,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-02-06 14:36:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2025-02-06 14:36:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 14:36:14,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:14,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:14,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:36:14,894 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:14,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 759159628, now seen corresponding path program 1 times [2025-02-06 14:36:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:14,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647809163] [2025-02-06 14:36:14,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:14,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 14:36:14,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 14:36:14,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:14,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:15,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:15,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647809163] [2025-02-06 14:36:15,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647809163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:15,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:15,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:36:15,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674183026] [2025-02-06 14:36:15,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:15,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:36:15,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:15,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:36:15,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:36:15,038 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-02-06 14:36:15,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:15,128 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2025-02-06 14:36:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:36:15,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 25 [2025-02-06 14:36:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:15,129 INFO L225 Difference]: With dead ends: 122 [2025-02-06 14:36:15,129 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 14:36:15,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:36:15,130 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 52 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:15,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 265 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 14:36:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 105. [2025-02-06 14:36:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-06 14:36:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2025-02-06 14:36:15,140 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 25 [2025-02-06 14:36:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:15,140 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2025-02-06 14:36:15,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-02-06 14:36:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2025-02-06 14:36:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 14:36:15,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:15,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:15,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:36:15,142 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:15,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2059111959, now seen corresponding path program 1 times [2025-02-06 14:36:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743736128] [2025-02-06 14:36:15,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:15,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:36:15,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:36:15,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:15,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:15,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:15,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743736128] [2025-02-06 14:36:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743736128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:15,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 14:36:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75204097] [2025-02-06 14:36:15,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:15,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:36:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:15,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:36:15,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:36:15,300 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-06 14:36:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:15,406 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2025-02-06 14:36:15,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 14:36:15,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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 26 [2025-02-06 14:36:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:15,407 INFO L225 Difference]: With dead ends: 121 [2025-02-06 14:36:15,407 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 14:36:15,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:36:15,408 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 50 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:15,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 265 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:36:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 14:36:15,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2025-02-06 14:36:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 93 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-06 14:36:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2025-02-06 14:36:15,415 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 26 [2025-02-06 14:36:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:15,415 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2025-02-06 14:36:15,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-02-06 14:36:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2025-02-06 14:36:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:36:15,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:15,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:36:15,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:36:15,417 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:15,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:15,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1233349319, now seen corresponding path program 1 times [2025-02-06 14:36:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:15,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645603711] [2025-02-06 14:36:15,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:15,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:36:15,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:36:15,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:15,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:36:15,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:36:15,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645603711] [2025-02-06 14:36:15,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645603711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:36:15,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:36:15,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:36:15,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760689791] [2025-02-06 14:36:15,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:36:15,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:36:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:36:15,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:36:15,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:36:15,486 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:36:15,523 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2025-02-06 14:36:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:36:15,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 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 29 [2025-02-06 14:36:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:36:15,524 INFO L225 Difference]: With dead ends: 115 [2025-02-06 14:36:15,524 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 14:36:15,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:36:15,525 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:36:15,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 200 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:36:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 14:36:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2025-02-06 14:36:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.3375) internal successors, (107), 97 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2025-02-06 14:36:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2025-02-06 14:36:15,533 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 29 [2025-02-06 14:36:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:36:15,533 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2025-02-06 14:36:15,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 14:36:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2025-02-06 14:36:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 14:36:15,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:36:15,534 INFO L218 NwaCegarLoop]: trace histogram [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-02-06 14:36:15,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 14:36:15,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_0_to_40_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_0_to_40_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_0_to_40_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-06 14:36:15,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:36:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2006497820, now seen corresponding path program 1 times [2025-02-06 14:36:15,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:36:15,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622114747] [2025-02-06 14:36:15,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:36:15,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:36:15,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:36:15,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:15,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:36:15,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53468140] [2025-02-06 14:36:15,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:36:15,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:36:15,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:36:15,564 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:36:15,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:36:15,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 14:36:15,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 14:36:15,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:36:15,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:36:15,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-06 14:36:15,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:36:15,677 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 11 [2025-02-06 14:36:15,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:15,680 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-02-06 14:36:15,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 14:36:35,204 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2025-02-06 14:36:35,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 43 [2025-02-06 14:36:39,882 INFO L349 Elim1Store]: treesize reduction 90, result has 47.7 percent of original size [2025-02-06 14:36:39,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 140 treesize of output 177 [2025-02-06 14:36:56,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 14:36:56,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 597 treesize of output 713 [2025-02-06 14:36:56,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 14:36:56,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 474 treesize of output 646 [2025-02-06 14:37:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:37:05,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:37:38,808 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 69 treesize of output 53