./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 551b0097 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-?-551b009-m [2025-01-10 02:36:37,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:36:37,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:36:37,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:36:37,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:36:37,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:36:37,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:36:37,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:36:37,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:36:37,885 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:36:37,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:36:37,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:36:37,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:36:37,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:36:37,885 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:36:37,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:36:37,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:36:37,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:36:37,887 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:36:37,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:36:37,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:36:37,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:36:37,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:36:37,888 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-01-10 02:36:38,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:36:38,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:36:38,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:36:38,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:36:38,189 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:36:38,189 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-01-10 02:36:39,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/459c5369e/8e0cb0d9690b4315a2724be8d50905ec/FLAG1d4ffbe3a [2025-01-10 02:36:39,666 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:36:39,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_prodbin-ll.c [2025-01-10 02:36:39,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/459c5369e/8e0cb0d9690b4315a2724be8d50905ec/FLAG1d4ffbe3a [2025-01-10 02:36:39,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/459c5369e/8e0cb0d9690b4315a2724be8d50905ec [2025-01-10 02:36:39,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:36:39,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:36:39,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:36:39,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:36:39,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:36:39,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25918fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39, skipping insertion in model container [2025-01-10 02:36:39,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:36:39,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:36:39,816 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:36:39,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:36:39,848 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:36:39,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39 WrapperNode [2025-01-10 02:36:39,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:36:39,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:36:39,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:36:39,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:36:39,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,874 INFO L138 Inliner]: procedures = 16, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-01-10 02:36:39,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:36:39,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:36:39,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:36:39,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:36:39,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,898 INFO L175 MemorySlicer]: Split 29 memory accesses to 6 slices as follows [2, 5, 8, 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, 2, 3, 2, 1, 1]. [2025-01-10 02:36:39,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:36:39,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:36:39,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:36:39,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:36:39,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (1/1) ... [2025-01-10 02:36:39,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:36:39,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:39,944 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-01-10 02:36:39,946 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-01-10 02:36:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:36:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:36:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:36:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:36:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:36:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:36:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:36:39,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_40_0 [2025-01-10 02:36:39,962 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_40_0 [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:36:39,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:36:39,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:36:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:36:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:36:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:36:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:36:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:36:39,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:36:39,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:36:40,023 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:36:40,025 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:36:40,255 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-01-10 02:36:40,255 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:36:40,261 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:36:40,261 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:36:40,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:40 BoogieIcfgContainer [2025-01-10 02:36:40,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:36:40,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:36:40,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:36:40,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:36:40,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:36:39" (1/3) ... [2025-01-10 02:36:40,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448eca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:40, skipping insertion in model container [2025-01-10 02:36:40,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:39" (2/3) ... [2025-01-10 02:36:40,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448eca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:40, skipping insertion in model container [2025-01-10 02:36:40,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:40" (3/3) ... [2025-01-10 02:36:40,267 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_prodbin-ll.c [2025-01-10 02:36:40,276 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:36:40,277 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-01-10 02:36:40,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:36:40,314 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;@62e9cc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:36:40,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 02:36:40,317 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-01-10 02:36:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:36:40,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:40,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:40,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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-01-10 02:36:40,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash -29049519, now seen corresponding path program 1 times [2025-01-10 02:36:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:40,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119342637] [2025-01-10 02:36:40,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:40,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:36:40,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:36:40,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:40,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:40,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:40,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119342637] [2025-01-10 02:36:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119342637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:40,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:40,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:36:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27605623] [2025-01-10 02:36:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:40,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:36:40,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:40,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:36:40,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:36:40,457 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-01-10 02:36:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:40,469 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2025-01-10 02:36:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:36:40,470 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-01-10 02:36:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:40,473 INFO L225 Difference]: With dead ends: 114 [2025-01-10 02:36:40,473 INFO L226 Difference]: Without dead ends: 52 [2025-01-10 02:36:40,475 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-01-10 02:36:40,477 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-01-10 02:36:40,477 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-01-10 02:36:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-10 02:36:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-10 02:36:40,496 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-01-10 02:36:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-01-10 02:36:40,499 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 8 [2025-01-10 02:36:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:40,499 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-01-10 02:36:40,499 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-01-10 02:36:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-01-10 02:36:40,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:36:40,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:40,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:40,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:36:40,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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-01-10 02:36:40,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash 28208783, now seen corresponding path program 1 times [2025-01-10 02:36:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204084756] [2025-01-10 02:36:40,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:40,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:36:40,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:36:40,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:40,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441851487] [2025-01-10 02:36:40,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:40,549 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-01-10 02:36:40,550 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-01-10 02:36:40,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:36:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:36:40,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:40,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-10 02:36:40,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:40,732 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-01-10 02:36:40,754 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-01-10 02:36:40,796 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-01-10 02:36:40,803 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-01-10 02:36:40,806 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-01-10 02:36:40,812 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-01-10 02:36:40,880 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-01-10 02:36:40,886 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-01-10 02:36:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:40,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:40,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204084756] [2025-01-10 02:36:40,901 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:40,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441851487] [2025-01-10 02:36:40,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441851487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:40,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:40,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:36:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761333105] [2025-01-10 02:36:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:36:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:40,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:36:40,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:40,903 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-01-10 02:36:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:41,128 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2025-01-10 02:36:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:36:41,128 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-01-10 02:36:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:41,129 INFO L225 Difference]: With dead ends: 90 [2025-01-10 02:36:41,129 INFO L226 Difference]: Without dead ends: 89 [2025-01-10 02:36:41,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-01-10 02:36:41,130 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-01-10 02:36:41,130 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-01-10 02:36:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-10 02:36:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2025-01-10 02:36:41,143 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-01-10 02:36:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-01-10 02:36:41,146 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 8 [2025-01-10 02:36:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:41,146 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-01-10 02:36:41,146 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-01-10 02:36:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-01-10 02:36:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:36:41,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:41,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:41,154 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-01-10 02:36:41,351 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-01-10 02:36:41,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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-01-10 02:36:41,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash 874472310, now seen corresponding path program 1 times [2025-01-10 02:36:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191188926] [2025-01-10 02:36:41,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:41,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:36:41,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:36:41,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:41,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:41,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384306297] [2025-01-10 02:36:41,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:41,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:41,400 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-01-10 02:36:41,403 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-01-10 02:36:41,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:36:41,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:36:41,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:41,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:41,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-10 02:36:41,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:41,506 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-01-10 02:36:41,513 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-01-10 02:36:41,550 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-01-10 02:36:41,556 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-01-10 02:36:41,559 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-01-10 02:36:41,562 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-01-10 02:36:41,684 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-01-10 02:36:41,695 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-01-10 02:36:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:41,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:41,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:41,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191188926] [2025-01-10 02:36:41,747 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:41,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384306297] [2025-01-10 02:36:41,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384306297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:41,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:41,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:36:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139756834] [2025-01-10 02:36:41,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:41,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:36:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:41,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:36:41,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:41,749 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-01-10 02:36:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:41,900 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2025-01-10 02:36:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:36:41,901 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-01-10 02:36:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:41,901 INFO L225 Difference]: With dead ends: 89 [2025-01-10 02:36:41,901 INFO L226 Difference]: Without dead ends: 88 [2025-01-10 02:36:41,901 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-01-10 02:36:41,902 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-01-10 02:36:41,902 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-01-10 02:36:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-10 02:36:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2025-01-10 02:36:41,906 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-01-10 02:36:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-01-10 02:36:41,907 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 9 [2025-01-10 02:36:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:41,907 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-01-10 02:36:41,907 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-01-10 02:36:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-01-10 02:36:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 02:36:41,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:41,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:41,913 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-01-10 02:36:42,112 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-01-10 02:36:42,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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-01-10 02:36:42,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1338837873, now seen corresponding path program 1 times [2025-01-10 02:36:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343255615] [2025-01-10 02:36:42,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:42,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:36:42,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:36:42,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:42,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:42,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343255615] [2025-01-10 02:36:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343255615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062804247] [2025-01-10 02:36:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:42,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:42,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:42,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:42,332 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-01-10 02:36:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:42,464 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-01-10 02:36:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:36:42,465 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-01-10 02:36:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:42,466 INFO L225 Difference]: With dead ends: 102 [2025-01-10 02:36:42,466 INFO L226 Difference]: Without dead ends: 101 [2025-01-10 02:36:42,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:36:42,467 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-01-10 02:36:42,467 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-01-10 02:36:42,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-10 02:36:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2025-01-10 02:36:42,475 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-01-10 02:36:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2025-01-10 02:36:42,476 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 10 [2025-01-10 02:36:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:42,476 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2025-01-10 02:36:42,476 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-01-10 02:36:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2025-01-10 02:36:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 02:36:42,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:42,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:42,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:36:42,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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-01-10 02:36:42,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:42,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1445698856, now seen corresponding path program 1 times [2025-01-10 02:36:42,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:42,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140240730] [2025-01-10 02:36:42,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:42,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 02:36:42,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 02:36:42,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:42,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140240730] [2025-01-10 02:36:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140240730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:42,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:42,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150135948] [2025-01-10 02:36:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:42,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:42,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:42,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:42,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:42,659 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-01-10 02:36:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:42,848 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-01-10 02:36:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:36:42,848 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-01-10 02:36:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:42,849 INFO L225 Difference]: With dead ends: 101 [2025-01-10 02:36:42,850 INFO L226 Difference]: Without dead ends: 100 [2025-01-10 02:36:42,850 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-01-10 02:36:42,851 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 67 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 255 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-01-10 02:36:42,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 255 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-10 02:36:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2025-01-10 02:36:42,862 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-01-10 02:36:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-01-10 02:36:42,863 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 11 [2025-01-10 02:36:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:42,863 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-01-10 02:36:42,863 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-01-10 02:36:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-01-10 02:36:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:36:42,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:42,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:42,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:36:42,863 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-01-10 02:36:42,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1866991533, now seen corresponding path program 1 times [2025-01-10 02:36:42,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:42,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332522543] [2025-01-10 02:36:42,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:42,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:42,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:36:42,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:36:42,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:42,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:42,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503277433] [2025-01-10 02:36:42,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:42,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:42,892 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-01-10 02:36:42,895 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-01-10 02:36:42,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:36:42,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:36:42,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:42,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:42,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-10 02:36:42,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:42,979 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-01-10 02:36:42,981 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-01-10 02:36:43,008 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-01-10 02:36:43,012 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-01-10 02:36:43,084 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-01-10 02:36:43,090 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-01-10 02:36:43,188 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-01-10 02:36:43,192 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-01-10 02:36:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:43,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:43,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332522543] [2025-01-10 02:36:43,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503277433] [2025-01-10 02:36:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503277433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 02:36:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26125561] [2025-01-10 02:36:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:43,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:36:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:43,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:36:43,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:36:43,223 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-01-10 02:36:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:43,551 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2025-01-10 02:36:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:36:43,552 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-01-10 02:36:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:43,553 INFO L225 Difference]: With dead ends: 121 [2025-01-10 02:36:43,553 INFO L226 Difference]: Without dead ends: 120 [2025-01-10 02:36:43,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-10 02:36:43,554 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.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:43,554 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.2s Time] [2025-01-10 02:36:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-10 02:36:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2025-01-10 02:36:43,561 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-01-10 02:36:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2025-01-10 02:36:43,562 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 12 [2025-01-10 02:36:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:43,562 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2025-01-10 02:36:43,562 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-01-10 02:36:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2025-01-10 02:36:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 02:36:43,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:43,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:36:43,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:36:43,763 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-01-10 02:36:43,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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-01-10 02:36:43,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2042162630, now seen corresponding path program 1 times [2025-01-10 02:36:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118949176] [2025-01-10 02:36:43,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:43,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:36:43,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:36:43,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:43,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:43,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115267352] [2025-01-10 02:36:43,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:43,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:43,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:43,778 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-01-10 02:36:43,779 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-01-10 02:36:43,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 02:36:43,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 02:36:43,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:43,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:43,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-10 02:36:43,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:43,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-10 02:36:43,856 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-01-10 02:36:43,859 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-01-10 02:36:43,862 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-01-10 02:36:43,913 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-01-10 02:36:43,919 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-01-10 02:36:43,988 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 21 treesize of output 13 [2025-01-10 02:36:43,991 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-01-10 02:36:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:44,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:36:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:44,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118949176] [2025-01-10 02:36:44,046 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:36:44,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115267352] [2025-01-10 02:36:44,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115267352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:44,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:44,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:36:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972750773] [2025-01-10 02:36:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:44,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:36:44,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:44,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:36:44,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:44,048 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 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-01-10 02:36:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:44,471 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2025-01-10 02:36:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:36:44,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 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-01-10 02:36:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:44,472 INFO L225 Difference]: With dead ends: 118 [2025-01-10 02:36:44,472 INFO L226 Difference]: Without dead ends: 117 [2025-01-10 02:36:44,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:36:44,473 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 87 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:44,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 244 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:36:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-10 02:36:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2025-01-10 02:36:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 94 states have internal predecessors, (116), 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-01-10 02:36:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2025-01-10 02:36:44,482 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 13 [2025-01-10 02:36:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:44,483 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2025-01-10 02:36:44,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 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-01-10 02:36:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2025-01-10 02:36:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 02:36:44,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:44,483 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-01-10 02:36:44,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:36:44,688 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-01-10 02:36:44,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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-01-10 02:36:44,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash 178608392, now seen corresponding path program 1 times [2025-01-10 02:36:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366199336] [2025-01-10 02:36:44,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:44,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 02:36:44,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 02:36:44,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:44,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366199336] [2025-01-10 02:36:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366199336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:44,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061077514] [2025-01-10 02:36:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:44,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:44,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:44,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:44,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:44,989 INFO L87 Difference]: Start difference. First operand 104 states and 136 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-01-10 02:36:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:45,092 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2025-01-10 02:36:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:45,092 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-01-10 02:36:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:45,093 INFO L225 Difference]: With dead ends: 111 [2025-01-10 02:36:45,093 INFO L226 Difference]: Without dead ends: 110 [2025-01-10 02:36:45,093 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-01-10 02:36:45,094 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 248 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.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:45,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 248 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-10 02:36:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2025-01-10 02:36:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 94 states have internal predecessors, (115), 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-01-10 02:36:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2025-01-10 02:36:45,108 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 22 [2025-01-10 02:36:45,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:45,108 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2025-01-10 02:36:45,108 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-01-10 02:36:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2025-01-10 02:36:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:36:45,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:45,109 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-01-10 02:36:45,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:36:45,109 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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-01-10 02:36:45,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1241902844, now seen corresponding path program 1 times [2025-01-10 02:36:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973338941] [2025-01-10 02:36:45,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:45,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:36:45,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:36:45,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:45,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:45,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973338941] [2025-01-10 02:36:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973338941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:45,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:45,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:45,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463465378] [2025-01-10 02:36:45,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:45,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:45,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:45,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:45,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:45,297 INFO L87 Difference]: Start difference. First operand 104 states and 135 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-01-10 02:36:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:45,361 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2025-01-10 02:36:45,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:36:45,362 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-01-10 02:36:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:45,362 INFO L225 Difference]: With dead ends: 116 [2025-01-10 02:36:45,363 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 02:36:45,363 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-01-10 02:36:45,363 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 43 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 254 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-01-10 02:36:45,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 254 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:36:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 02:36:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2025-01-10 02:36:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 94 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-01-10 02:36:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 133 transitions. [2025-01-10 02:36:45,369 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 133 transitions. Word has length 23 [2025-01-10 02:36:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:45,369 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 133 transitions. [2025-01-10 02:36:45,370 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-01-10 02:36:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2025-01-10 02:36:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:36:45,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:45,370 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-01-10 02:36:45,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:36:45,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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-01-10 02:36:45,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:45,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1241892914, now seen corresponding path program 1 times [2025-01-10 02:36:45,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:45,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322673829] [2025-01-10 02:36:45,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:45,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:45,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:36:45,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:36:45,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:45,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:45,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322673829] [2025-01-10 02:36:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322673829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:45,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357140824] [2025-01-10 02:36:45,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:45,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:45,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:45,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:45,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:45,553 INFO L87 Difference]: Start difference. First operand 104 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-01-10 02:36:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:45,630 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2025-01-10 02:36:45,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:45,631 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-01-10 02:36:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:45,631 INFO L225 Difference]: With dead ends: 109 [2025-01-10 02:36:45,631 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 02:36:45,632 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-01-10 02:36:45,632 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 251 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-01-10 02:36:45,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 251 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:36:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 02:36:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-01-10 02:36:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.4933333333333334) internal successors, (112), 94 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-01-10 02:36:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2025-01-10 02:36:45,640 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 23 [2025-01-10 02:36:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:45,641 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2025-01-10 02:36:45,641 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-01-10 02:36:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2025-01-10 02:36:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:36:45,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:45,642 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-01-10 02:36:45,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:36:45,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_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-01-10 02:36:45,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -156143378, now seen corresponding path program 1 times [2025-01-10 02:36:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41471222] [2025-01-10 02:36:45,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:45,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:36:45,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:36:45,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:45,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41471222] [2025-01-10 02:36:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41471222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 02:36:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26714860] [2025-01-10 02:36:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:45,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:36:45,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:45,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:36:45,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:36:45,797 INFO L87 Difference]: Start difference. First operand 104 states and 132 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-01-10 02:36:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:45,896 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2025-01-10 02:36:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 02:36:45,896 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-01-10 02:36:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:45,897 INFO L225 Difference]: With dead ends: 122 [2025-01-10 02:36:45,897 INFO L226 Difference]: Without dead ends: 115 [2025-01-10 02:36:45,897 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-01-10 02:36:45,898 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 58 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:45,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 222 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-10 02:36:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2025-01-10 02:36:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 94 states have internal predecessors, (112), 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-01-10 02:36:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2025-01-10 02:36:45,911 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 24 [2025-01-10 02:36:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:45,911 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2025-01-10 02:36:45,911 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-01-10 02:36:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2025-01-10 02:36:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:36:45,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:45,911 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-01-10 02:36:45,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:36:45,912 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-01-10 02:36:45,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash -155717430, now seen corresponding path program 1 times [2025-01-10 02:36:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:45,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164901285] [2025-01-10 02:36:45,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:45,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:45,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:36:45,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:36:45,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:45,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:46,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164901285] [2025-01-10 02:36:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164901285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:46,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:46,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:46,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120244188] [2025-01-10 02:36:46,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:46,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:46,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:46,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:46,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:46,069 INFO L87 Difference]: Start difference. First operand 106 states and 134 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-01-10 02:36:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:46,140 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2025-01-10 02:36:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:46,140 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-01-10 02:36:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:46,141 INFO L225 Difference]: With dead ends: 109 [2025-01-10 02:36:46,141 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 02:36:46,141 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-01-10 02:36:46,143 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 30 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 261 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-01-10 02:36:46,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 261 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:36:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 02:36:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2025-01-10 02:36:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 94 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-01-10 02:36:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 132 transitions. [2025-01-10 02:36:46,150 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 132 transitions. Word has length 24 [2025-01-10 02:36:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:46,150 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 132 transitions. [2025-01-10 02:36:46,150 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-01-10 02:36:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 132 transitions. [2025-01-10 02:36:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-10 02:36:46,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:46,151 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-01-10 02:36:46,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:36:46,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-01-10 02:36:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash -156025270, now seen corresponding path program 1 times [2025-01-10 02:36:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:46,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774524732] [2025-01-10 02:36:46,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:46,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:46,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 02:36:46,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 02:36:46,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:46,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:46,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:46,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774524732] [2025-01-10 02:36:46,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774524732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:46,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:46,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:46,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893426607] [2025-01-10 02:36:46,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:46,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:46,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:46,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:46,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:46,292 INFO L87 Difference]: Start difference. First operand 106 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-01-10 02:36:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:46,380 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2025-01-10 02:36:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:46,381 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-01-10 02:36:46,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:46,382 INFO L225 Difference]: With dead ends: 110 [2025-01-10 02:36:46,382 INFO L226 Difference]: Without dead ends: 109 [2025-01-10 02:36:46,382 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-01-10 02:36:46,383 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 240 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-01-10 02:36:46,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 240 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-10 02:36:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2025-01-10 02:36:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 94 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-01-10 02:36:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2025-01-10 02:36:46,396 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 24 [2025-01-10 02:36:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:46,398 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2025-01-10 02:36:46,399 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-01-10 02:36:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2025-01-10 02:36:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:36:46,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:46,399 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-01-10 02:36:46,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:36:46,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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-01-10 02:36:46,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash -532272962, now seen corresponding path program 1 times [2025-01-10 02:36:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964914637] [2025-01-10 02:36:46,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:46,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:36:46,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:36:46,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:46,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964914637] [2025-01-10 02:36:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964914637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435737267] [2025-01-10 02:36:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:46,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:46,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:46,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:46,551 INFO L87 Difference]: Start difference. First operand 106 states and 131 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-01-10 02:36:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:46,659 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2025-01-10 02:36:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:36:46,660 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-01-10 02:36:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:46,660 INFO L225 Difference]: With dead ends: 124 [2025-01-10 02:36:46,661 INFO L226 Difference]: Without dead ends: 123 [2025-01-10 02:36:46,661 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-01-10 02:36:46,662 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:46,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 230 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-10 02:36:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2025-01-10 02:36:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 94 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-01-10 02:36:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2025-01-10 02:36:46,687 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 25 [2025-01-10 02:36:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:46,687 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2025-01-10 02:36:46,687 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-01-10 02:36:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2025-01-10 02:36:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 02:36:46,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:46,689 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-01-10 02:36:46,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:36:46,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-01-10 02:36:46,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash -541816012, now seen corresponding path program 1 times [2025-01-10 02:36:46,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:46,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439275348] [2025-01-10 02:36:46,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:46,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:46,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 02:36:46,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 02:36:46,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:46,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439275348] [2025-01-10 02:36:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439275348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:36:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130758476] [2025-01-10 02:36:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:46,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:36:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:46,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:36:46,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:36:46,812 INFO L87 Difference]: Start difference. First operand 106 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-01-10 02:36:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:46,889 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2025-01-10 02:36:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:36:46,890 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-01-10 02:36:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:46,890 INFO L225 Difference]: With dead ends: 109 [2025-01-10 02:36:46,890 INFO L226 Difference]: Without dead ends: 108 [2025-01-10 02:36:46,891 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-01-10 02:36:46,891 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 31 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 243 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:46,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 243 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:36:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-10 02:36:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2025-01-10 02:36:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.394736842105263) internal successors, (106), 94 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-01-10 02:36:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2025-01-10 02:36:46,900 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 25 [2025-01-10 02:36:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:46,900 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2025-01-10 02:36:46,900 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-01-10 02:36:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2025-01-10 02:36:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:36:46,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:46,901 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-01-10 02:36:46,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:36:46,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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-01-10 02:36:46,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash 679407436, now seen corresponding path program 1 times [2025-01-10 02:36:46,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:46,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928677138] [2025-01-10 02:36:46,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:46,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:46,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:36:46,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:36:46,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:46,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:36:47,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:36:47,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928677138] [2025-01-10 02:36:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928677138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:36:47,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:36:47,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 02:36:47,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975724168] [2025-01-10 02:36:47,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:36:47,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 02:36:47,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:36:47,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 02:36:47,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:36:47,059 INFO L87 Difference]: Start difference. First operand 106 states and 128 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-01-10 02:36:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:36:47,160 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2025-01-10 02:36:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:36:47,161 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-01-10 02:36:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:36:47,162 INFO L225 Difference]: With dead ends: 123 [2025-01-10 02:36:47,162 INFO L226 Difference]: Without dead ends: 122 [2025-01-10 02:36:47,162 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-01-10 02:36:47,162 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 52 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:36:47,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 233 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:36:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-10 02:36:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2025-01-10 02:36:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.368421052631579) internal successors, (104), 94 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-01-10 02:36:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2025-01-10 02:36:47,172 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 26 [2025-01-10 02:36:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:36:47,173 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2025-01-10 02:36:47,173 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-01-10 02:36:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2025-01-10 02:36:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:36:47,174 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:36:47,175 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-01-10 02:36:47,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 02:36:47,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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-01-10 02:36:47,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:36:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash -439147335, now seen corresponding path program 1 times [2025-01-10 02:36:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:36:47,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646804473] [2025-01-10 02:36:47,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:36:47,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:36:47,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:36:47,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:36:47,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733151885] [2025-01-10 02:36:47,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:36:47,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:36:47,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:36:47,203 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-01-10 02:36:47,208 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-01-10 02:36:47,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:36:47,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:36:47,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:36:47,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:36:47,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-01-10 02:36:47,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:36:47,375 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-01-10 02:36:47,383 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-01-10 02:36:47,385 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-01-10 02:36:47,386 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-01-10 02:37:12,032 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2025-01-10 02:37:12,033 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-01-10 02:37:16,543 INFO L349 Elim1Store]: treesize reduction 90, result has 47.7 percent of original size [2025-01-10 02:37:16,543 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 139 treesize of output 176 [2025-01-10 02:37:38,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 02:37:38,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1394 treesize of output 1854 [2025-01-10 02:37:38,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 02:37:38,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 1207 treesize of output 1527 [2025-01-10 02:38:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:38:17,222 INFO L312 TraceCheckSpWp]: Computing backward predicates...