./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_loop-simple/recursified_deep-nested.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:10:00,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:10:00,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:10:00,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:10:00,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:10:00,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:10:00,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:10:00,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:10:00,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:10:00,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:10:00,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:10:00,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:10:00,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:10:00,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:10:00,203 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:10:00,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:10:00,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:10:00,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:00,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:00,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:10:00,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:10:00,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:10:00,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:10:00,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:10:00,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:10:00,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:10:00,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:10:00,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:10:00,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:10:00,206 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 ! call(reach_error())) ) 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 -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a [2025-01-09 04:10:00,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:10:00,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:10:00,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:10:00,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:10:00,430 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:10:00,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2025-01-09 04:10:01,718 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4652bfad/95504ee1985f4f5dbd7575d0f210475b/FLAG7d45f278c [2025-01-09 04:10:01,964 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:10:01,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2025-01-09 04:10:01,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4652bfad/95504ee1985f4f5dbd7575d0f210475b/FLAG7d45f278c [2025-01-09 04:10:01,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4652bfad/95504ee1985f4f5dbd7575d0f210475b [2025-01-09 04:10:01,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:10:01,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:10:01,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:01,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:10:01,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:10:01,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:01" (1/1) ... [2025-01-09 04:10:01,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0572d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:01, skipping insertion in model container [2025-01-09 04:10:01,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:01" (1/1) ... [2025-01-09 04:10:02,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:10:02,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2025-01-09 04:10:02,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:02,131 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:10:02,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2025-01-09 04:10:02,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:02,155 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:10:02,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02 WrapperNode [2025-01-09 04:10:02,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:02,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:02,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:10:02,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:10:02,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,175 INFO L138 Inliner]: procedures = 16, calls = 71, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2025-01-09 04:10:02,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:02,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:10:02,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:10:02,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:10:02,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,194 INFO L175 MemorySlicer]: Split 38 memory accesses to 7 slices as follows [2, 6, 6, 7, 6, 5, 6]. 18 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 11 writes are split as follows [0, 2, 2, 1, 2, 2, 2]. [2025-01-09 04:10:02,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:10:02,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:10:02,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:10:02,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:10:02,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (1/1) ... [2025-01-09 04:10:02,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:02,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:02,231 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-09 04:10:02,236 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-09 04:10:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2025-01-09 04:10:02,250 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2025-01-09 04:10:02,250 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2025-01-09 04:10:02,250 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:10:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2025-01-09 04:10:02,251 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2025-01-09 04:10:02,251 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:10:02,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:10:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:10:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:10:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:10:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:10:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:10:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:10:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 04:10:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:10:02,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:10:02,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:10:02,491 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 04:10:02,491 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:10:02,497 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:10:02,497 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:10:02,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:02 BoogieIcfgContainer [2025-01-09 04:10:02,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:10:02,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:10:02,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:10:02,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:10:02,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:10:01" (1/3) ... [2025-01-09 04:10:02,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10536f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:02, skipping insertion in model container [2025-01-09 04:10:02,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:02" (2/3) ... [2025-01-09 04:10:02,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10536f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:02, skipping insertion in model container [2025-01-09 04:10:02,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:02" (3/3) ... [2025-01-09 04:10:02,504 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_deep-nested.c [2025-01-09 04:10:02,513 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:10:02,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_deep-nested.c that has 6 procedures, 51 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:10:02,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:10:02,552 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;@73ef0b3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:10:02,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:10:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 04:10:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 04:10:02,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:02,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:02,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:02,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1592718110, now seen corresponding path program 1 times [2025-01-09 04:10:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049734979] [2025-01-09 04:10:02,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:02,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 04:10:02,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 04:10:02,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:02,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049734979] [2025-01-09 04:10:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049734979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:02,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:02,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:10:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276069283] [2025-01-09 04:10:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:02,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:10:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:02,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:10:02,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:10:02,960 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:03,002 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2025-01-09 04:10:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:10:03,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 04:10:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:03,010 INFO L225 Difference]: With dead ends: 102 [2025-01-09 04:10:03,010 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 04:10:03,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:10:03,015 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:03,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 04:10:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-01-09 04:10:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.28125) internal successors, (41), 37 states have internal predecessors, (41), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 04:10:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-01-09 04:10:03,045 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 26 [2025-01-09 04:10:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:03,045 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-01-09 04:10:03,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-01-09 04:10:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 04:10:03,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:03,047 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-09 04:10:03,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:10:03,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:03,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1590871068, now seen corresponding path program 1 times [2025-01-09 04:10:03,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742225509] [2025-01-09 04:10:03,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:03,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 04:10:03,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 04:10:03,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:03,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:03,269 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-09 04:10:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742225509] [2025-01-09 04:10:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742225509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:10:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667929854] [2025-01-09 04:10:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:03,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:10:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:03,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:10:03,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:10:03,271 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:03,311 INFO L93 Difference]: Finished difference Result 94 states and 128 transitions. [2025-01-09 04:10:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:10:03,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 04:10:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:03,313 INFO L225 Difference]: With dead ends: 94 [2025-01-09 04:10:03,314 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 04:10:03,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:10:03,316 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:03,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 200 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 04:10:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 04:10:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 04:10:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2025-01-09 04:10:03,327 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 26 [2025-01-09 04:10:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:03,329 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2025-01-09 04:10:03,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2025-01-09 04:10:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 04:10:03,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:03,330 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-09 04:10:03,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:10:03,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:03,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:03,331 INFO L85 PathProgramCache]: Analyzing trace with hash 927241824, now seen corresponding path program 1 times [2025-01-09 04:10:03,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:03,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287099099] [2025-01-09 04:10:03,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:03,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:03,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 04:10:03,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 04:10:03,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:03,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:04,190 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-09 04:10:04,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:04,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287099099] [2025-01-09 04:10:04,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287099099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:04,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:04,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 04:10:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051102386] [2025-01-09 04:10:04,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:04,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:10:04,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:04,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:10:04,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:10:04,195 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:04,548 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2025-01-09 04:10:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:10:04,548 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 04:10:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:04,550 INFO L225 Difference]: With dead ends: 72 [2025-01-09 04:10:04,552 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 04:10:04,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:10:04,553 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 55 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:04,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 388 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 04:10:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2025-01-09 04:10:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-09 04:10:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2025-01-09 04:10:04,571 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 26 [2025-01-09 04:10:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:04,571 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2025-01-09 04:10:04,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2025-01-09 04:10:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 04:10:04,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:04,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:04,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:10:04,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:04,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2114196936, now seen corresponding path program 1 times [2025-01-09 04:10:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79290537] [2025-01-09 04:10:04,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:04,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:10:04,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:10:04,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:04,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79290537] [2025-01-09 04:10:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79290537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507365066] [2025-01-09 04:10:05,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:05,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:05,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:05,717 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-09 04:10:05,719 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-09 04:10:05,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:10:05,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:10:05,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:05,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:05,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-01-09 04:10:05,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:05,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:06,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:06,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:06,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 04:10:06,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 04:10:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:10:06,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:10:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507365066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:06,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:10:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 28 [2025-01-09 04:10:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119383101] [2025-01-09 04:10:06,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:06,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:10:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:06,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:10:06,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:10:06,378 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:06,748 INFO L93 Difference]: Finished difference Result 177 states and 234 transitions. [2025-01-09 04:10:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:10:06,749 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-09 04:10:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:06,750 INFO L225 Difference]: With dead ends: 177 [2025-01-09 04:10:06,752 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 04:10:06,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 04:10:06,753 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 61 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:06,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 393 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 04:10:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2025-01-09 04:10:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 94 states have internal predecessors, (113), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (17), 9 states have call predecessors, (17), 12 states have call successors, (17) [2025-01-09 04:10:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 144 transitions. [2025-01-09 04:10:06,770 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 144 transitions. Word has length 38 [2025-01-09 04:10:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:06,770 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 144 transitions. [2025-01-09 04:10:06,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2025-01-09 04:10:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 04:10:06,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:06,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:06,783 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-09 04:10:06,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:06,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:06,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:06,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1918582334, now seen corresponding path program 1 times [2025-01-09 04:10:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-01-09 04:10:06,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:07,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:10:07,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:10:07,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:07,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:07,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:07,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-01-09 04:10:07,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776024483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:07,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122519930] [2025-01-09 04:10:07,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:07,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:07,713 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-09 04:10:07,714 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-09 04:10:07,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:10:07,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:10:07,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:07,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:07,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 163 conjuncts are in the unsatisfiable core [2025-01-09 04:10:07,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:07,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:07,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:08,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:08,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:08,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 04:10:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:08,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:08,903 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 35 treesize of output 27 [2025-01-09 04:10:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122519930] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:09,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 14] total 46 [2025-01-09 04:10:09,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381709480] [2025-01-09 04:10:09,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:09,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 04:10:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:09,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 04:10:09,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1917, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 04:10:09,422 INFO L87 Difference]: Start difference. First operand 110 states and 144 transitions. Second operand has 46 states, 38 states have (on average 2.236842105263158) internal successors, (85), 34 states have internal predecessors, (85), 13 states have call successors, (15), 13 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:12,819 INFO L93 Difference]: Finished difference Result 444 states and 597 transitions. [2025-01-09 04:10:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-01-09 04:10:12,820 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.236842105263158) internal successors, (85), 34 states have internal predecessors, (85), 13 states have call successors, (15), 13 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-09 04:10:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:12,823 INFO L225 Difference]: With dead ends: 444 [2025-01-09 04:10:12,823 INFO L226 Difference]: Without dead ends: 337 [2025-01-09 04:10:12,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2539 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1042, Invalid=9670, Unknown=0, NotChecked=0, Total=10712 [2025-01-09 04:10:12,831 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 374 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:12,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1024 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:10:12,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-09 04:10:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 271. [2025-01-09 04:10:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 218 states have (on average 1.3211009174311927) internal successors, (288), 238 states have internal predecessors, (288), 27 states have call successors, (27), 24 states have call predecessors, (27), 25 states have return successors, (44), 19 states have call predecessors, (44), 25 states have call successors, (44) [2025-01-09 04:10:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 359 transitions. [2025-01-09 04:10:12,873 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 359 transitions. Word has length 38 [2025-01-09 04:10:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:12,873 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 359 transitions. [2025-01-09 04:10:12,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.236842105263158) internal successors, (85), 34 states have internal predecessors, (85), 13 states have call successors, (15), 13 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 359 transitions. [2025-01-09 04:10:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 04:10:12,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:12,875 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:12,884 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-09 04:10:13,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:13,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:13,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1570996196, now seen corresponding path program 1 times [2025-01-09 04:10:13,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:13,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124283638] [2025-01-09 04:10:13,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:13,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:13,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 04:10:13,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 04:10:13,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:13,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:10:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:13,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124283638] [2025-01-09 04:10:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124283638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:13,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:13,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 04:10:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975734563] [2025-01-09 04:10:13,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:13,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:10:13,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:13,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:10:13,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:10:13,617 INFO L87 Difference]: Start difference. First operand 271 states and 359 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:13,989 INFO L93 Difference]: Finished difference Result 569 states and 771 transitions. [2025-01-09 04:10:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:10:13,991 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-01-09 04:10:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:13,995 INFO L225 Difference]: With dead ends: 569 [2025-01-09 04:10:13,998 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 04:10:13,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:10:13,999 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 74 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:13,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 333 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 04:10:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 277. [2025-01-09 04:10:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 221 states have (on average 1.2941176470588236) internal successors, (286), 236 states have internal predecessors, (286), 27 states have call successors, (27), 24 states have call predecessors, (27), 28 states have return successors, (48), 19 states have call predecessors, (48), 25 states have call successors, (48) [2025-01-09 04:10:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 361 transitions. [2025-01-09 04:10:14,025 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 361 transitions. Word has length 47 [2025-01-09 04:10:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:14,025 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 361 transitions. [2025-01-09 04:10:14,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 361 transitions. [2025-01-09 04:10:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 04:10:14,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:14,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:10:14,027 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:14,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -494750634, now seen corresponding path program 1 times [2025-01-09 04:10:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829077779] [2025-01-09 04:10:14,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:14,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 04:10:14,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 04:10:14,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:14,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 04:10:14,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:14,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829077779] [2025-01-09 04:10:14,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829077779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:14,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:14,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:10:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252234347] [2025-01-09 04:10:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:14,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:10:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:14,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:10:14,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:10:14,521 INFO L87 Difference]: Start difference. First operand 277 states and 361 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:14,802 INFO L93 Difference]: Finished difference Result 559 states and 730 transitions. [2025-01-09 04:10:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:10:14,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2025-01-09 04:10:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:14,805 INFO L225 Difference]: With dead ends: 559 [2025-01-09 04:10:14,805 INFO L226 Difference]: Without dead ends: 283 [2025-01-09 04:10:14,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:10:14,806 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 53 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:14,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 75 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-09 04:10:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2025-01-09 04:10:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 237 states have internal predecessors, (287), 27 states have call successors, (27), 24 states have call predecessors, (27), 30 states have return successors, (50), 19 states have call predecessors, (50), 25 states have call successors, (50) [2025-01-09 04:10:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 364 transitions. [2025-01-09 04:10:14,822 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 364 transitions. Word has length 59 [2025-01-09 04:10:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 364 transitions. [2025-01-09 04:10:14,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 364 transitions. [2025-01-09 04:10:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:10:14,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:14,824 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:14,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:10:14,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:14,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1205689733, now seen corresponding path program 1 times [2025-01-09 04:10:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:14,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533981619] [2025-01-09 04:10:14,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:14,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:10:14,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:10:14,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:14,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:10:15,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:15,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533981619] [2025-01-09 04:10:15,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533981619] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:15,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041675423] [2025-01-09 04:10:15,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:15,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:15,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:15,894 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-09 04:10:15,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-09 04:10:15,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:10:16,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:10:16,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:16,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:16,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 187 conjuncts are in the unsatisfiable core [2025-01-09 04:10:16,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:16,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:16,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:16,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:16,801 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 18 treesize of output 14 [2025-01-09 04:10:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:10:17,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:17,923 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 33 treesize of output 25 [2025-01-09 04:10:18,079 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 33 treesize of output 25 [2025-01-09 04:10:18,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 35 treesize of output 27 [2025-01-09 04:10:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041675423] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:18,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:18,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28] total 42 [2025-01-09 04:10:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891195747] [2025-01-09 04:10:18,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:18,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 04:10:18,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:18,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 04:10:18,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2817, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 04:10:18,856 INFO L87 Difference]: Start difference. First operand 281 states and 364 transitions. Second operand has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 33 states have internal predecessors, (87), 14 states have call successors, (17), 11 states have call predecessors, (17), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 04:10:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:22,163 INFO L93 Difference]: Finished difference Result 780 states and 1077 transitions. [2025-01-09 04:10:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 04:10:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 33 states have internal predecessors, (87), 14 states have call successors, (17), 11 states have call predecessors, (17), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 61 [2025-01-09 04:10:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:22,168 INFO L225 Difference]: With dead ends: 780 [2025-01-09 04:10:22,168 INFO L226 Difference]: Without dead ends: 482 [2025-01-09 04:10:22,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2621 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=757, Invalid=10799, Unknown=0, NotChecked=0, Total=11556 [2025-01-09 04:10:22,171 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 244 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:22,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 681 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:10:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-01-09 04:10:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 387. [2025-01-09 04:10:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 314 states have (on average 1.286624203821656) internal successors, (404), 331 states have internal predecessors, (404), 36 states have call successors, (36), 28 states have call predecessors, (36), 36 states have return successors, (77), 27 states have call predecessors, (77), 34 states have call successors, (77) [2025-01-09 04:10:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 517 transitions. [2025-01-09 04:10:22,207 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 517 transitions. Word has length 61 [2025-01-09 04:10:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:22,207 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 517 transitions. [2025-01-09 04:10:22,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 33 states have internal predecessors, (87), 14 states have call successors, (17), 11 states have call predecessors, (17), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 04:10:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 517 transitions. [2025-01-09 04:10:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:10:22,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:22,209 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:22,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:10:22,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:22,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:22,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash 422003117, now seen corresponding path program 1 times [2025-01-09 04:10:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:22,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731823194] [2025-01-09 04:10:22,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:22,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:22,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:10:22,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:10:22,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:22,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 04:10:22,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:22,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731823194] [2025-01-09 04:10:22,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731823194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:22,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67768399] [2025-01-09 04:10:22,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:22,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:22,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:22,889 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-09 04:10:22,891 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-09 04:10:22,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:10:23,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:10:23,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:23,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:23,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 237 conjuncts are in the unsatisfiable core [2025-01-09 04:10:23,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:23,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:23,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:23,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 04:10:23,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67768399] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:24,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:24,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 24 [2025-01-09 04:10:24,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490329685] [2025-01-09 04:10:24,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:24,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 04:10:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:24,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 04:10:24,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 04:10:24,568 INFO L87 Difference]: Start difference. First operand 387 states and 517 transitions. Second operand has 24 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 10 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:10:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:26,720 INFO L93 Difference]: Finished difference Result 819 states and 1111 transitions. [2025-01-09 04:10:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 04:10:26,720 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 10 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2025-01-09 04:10:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:26,723 INFO L225 Difference]: With dead ends: 819 [2025-01-09 04:10:26,723 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 04:10:26,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=485, Invalid=5995, Unknown=0, NotChecked=0, Total=6480 [2025-01-09 04:10:26,727 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 180 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:26,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 146 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:10:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 04:10:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 399. [2025-01-09 04:10:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 321 states have (on average 1.280373831775701) internal successors, (411), 338 states have internal predecessors, (411), 40 states have call successors, (40), 30 states have call predecessors, (40), 37 states have return successors, (83), 30 states have call predecessors, (83), 36 states have call successors, (83) [2025-01-09 04:10:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 534 transitions. [2025-01-09 04:10:26,754 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 534 transitions. Word has length 70 [2025-01-09 04:10:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:26,755 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 534 transitions. [2025-01-09 04:10:26,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 10 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:10:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 534 transitions. [2025-01-09 04:10:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:10:26,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:26,757 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:26,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:10:26,961 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,SelfDestructingSolverStorable8 [2025-01-09 04:10:26,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:26,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1510272090, now seen corresponding path program 1 times [2025-01-09 04:10:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:26,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609850729] [2025-01-09 04:10:26,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:26,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:10:26,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:10:26,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:26,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-09 04:10:27,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:27,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609850729] [2025-01-09 04:10:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609850729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:27,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:27,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:10:27,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261839023] [2025-01-09 04:10:27,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:27,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:10:27,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:27,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:10:27,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:10:27,054 INFO L87 Difference]: Start difference. First operand 399 states and 534 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:10:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:27,097 INFO L93 Difference]: Finished difference Result 786 states and 1111 transitions. [2025-01-09 04:10:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:10:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2025-01-09 04:10:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:27,100 INFO L225 Difference]: With dead ends: 786 [2025-01-09 04:10:27,100 INFO L226 Difference]: Without dead ends: 381 [2025-01-09 04:10:27,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:10:27,102 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:27,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-01-09 04:10:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 366. [2025-01-09 04:10:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 292 states have (on average 1.226027397260274) internal successors, (358), 307 states have internal predecessors, (358), 38 states have call successors, (38), 29 states have call predecessors, (38), 35 states have return successors, (78), 29 states have call predecessors, (78), 35 states have call successors, (78) [2025-01-09 04:10:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 474 transitions. [2025-01-09 04:10:27,135 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 474 transitions. Word has length 75 [2025-01-09 04:10:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:27,135 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 474 transitions. [2025-01-09 04:10:27,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:10:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 474 transitions. [2025-01-09 04:10:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 04:10:27,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:27,138 INFO L218 NwaCegarLoop]: trace histogram [12, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:10:27,138 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:27,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1119264941, now seen corresponding path program 1 times [2025-01-09 04:10:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:27,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400143164] [2025-01-09 04:10:27,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:27,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 04:10:27,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 04:10:27,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:27,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 262 proven. 182 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-01-09 04:10:29,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400143164] [2025-01-09 04:10:29,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400143164] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226691198] [2025-01-09 04:10:29,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:29,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:29,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:29,213 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-09 04:10:29,215 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-09 04:10:29,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 04:10:29,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 04:10:29,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:29,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:29,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 236 conjuncts are in the unsatisfiable core [2025-01-09 04:10:29,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:29,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:29,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:30,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 277 proven. 18 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-01-09 04:10:30,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:32,359 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 17 [2025-01-09 04:10:32,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226691198] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:32,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:32,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 38 [2025-01-09 04:10:32,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075717917] [2025-01-09 04:10:32,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:32,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 04:10:32,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:32,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 04:10:32,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 04:10:32,625 INFO L87 Difference]: Start difference. First operand 366 states and 474 transitions. Second operand has 38 states, 30 states have (on average 4.266666666666667) internal successors, (128), 34 states have internal predecessors, (128), 19 states have call successors, (29), 8 states have call predecessors, (29), 13 states have return successors, (24), 13 states have call predecessors, (24), 16 states have call successors, (24) [2025-01-09 04:10:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:36,452 INFO L93 Difference]: Finished difference Result 1060 states and 1459 transitions. [2025-01-09 04:10:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 04:10:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 30 states have (on average 4.266666666666667) internal successors, (128), 34 states have internal predecessors, (128), 19 states have call successors, (29), 8 states have call predecessors, (29), 13 states have return successors, (24), 13 states have call predecessors, (24), 16 states have call successors, (24) Word has length 198 [2025-01-09 04:10:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:36,456 INFO L225 Difference]: With dead ends: 1060 [2025-01-09 04:10:36,456 INFO L226 Difference]: Without dead ends: 533 [2025-01-09 04:10:36,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2378 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=726, Invalid=10830, Unknown=0, NotChecked=0, Total=11556 [2025-01-09 04:10:36,460 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 202 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 2458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:36,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 250 Invalid, 2458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:10:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-01-09 04:10:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 484. [2025-01-09 04:10:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 388 states have (on average 1.2396907216494846) internal successors, (481), 401 states have internal predecessors, (481), 45 states have call successors, (45), 38 states have call predecessors, (45), 50 states have return successors, (105), 44 states have call predecessors, (105), 41 states have call successors, (105) [2025-01-09 04:10:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 631 transitions. [2025-01-09 04:10:36,492 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 631 transitions. Word has length 198 [2025-01-09 04:10:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:36,492 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 631 transitions. [2025-01-09 04:10:36,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 30 states have (on average 4.266666666666667) internal successors, (128), 34 states have internal predecessors, (128), 19 states have call successors, (29), 8 states have call predecessors, (29), 13 states have return successors, (24), 13 states have call predecessors, (24), 16 states have call successors, (24) [2025-01-09 04:10:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 631 transitions. [2025-01-09 04:10:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-09 04:10:36,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:36,495 INFO L218 NwaCegarLoop]: trace histogram [23, 20, 18, 18, 18, 18, 18, 17, 17, 17, 15, 15, 14, 14, 9, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:36,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:10:36,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 04:10:36,696 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -822449693, now seen corresponding path program 2 times [2025-01-09 04:10:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:36,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256619872] [2025-01-09 04:10:36,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:36,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:36,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 357 statements into 2 equivalence classes. [2025-01-09 04:10:36,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 04:10:36,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:36,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 572 proven. 32 refuted. 0 times theorem prover too weak. 1988 trivial. 0 not checked. [2025-01-09 04:10:39,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256619872] [2025-01-09 04:10:39,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256619872] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387022051] [2025-01-09 04:10:39,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:39,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:39,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:39,610 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:10:39,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:10:39,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 357 statements into 2 equivalence classes. [2025-01-09 04:10:40,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 357 of 357 statements. [2025-01-09 04:10:40,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:40,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:40,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 2949 conjuncts, 356 conjuncts are in the unsatisfiable core [2025-01-09 04:10:40,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:40,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:40,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:40,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:40,992 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 15 [2025-01-09 04:10:41,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 04:10:41,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:10:42,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 04:10:43,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 04:10:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1241 proven. 782 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-01-09 04:10:43,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387022051] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:45,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:45,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 43] total 62 [2025-01-09 04:10:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439390505] [2025-01-09 04:10:45,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:45,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-09 04:10:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:45,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-09 04:10:45,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=4190, Unknown=0, NotChecked=0, Total=4422 [2025-01-09 04:10:45,522 INFO L87 Difference]: Start difference. First operand 484 states and 631 transitions. Second operand has 62 states, 50 states have (on average 3.88) internal successors, (194), 46 states have internal predecessors, (194), 28 states have call successors, (40), 17 states have call predecessors, (40), 12 states have return successors, (27), 17 states have call predecessors, (27), 19 states have call successors, (27) [2025-01-09 04:10:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:50,376 INFO L93 Difference]: Finished difference Result 1242 states and 1768 transitions. [2025-01-09 04:10:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-01-09 04:10:50,377 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 50 states have (on average 3.88) internal successors, (194), 46 states have internal predecessors, (194), 28 states have call successors, (40), 17 states have call predecessors, (40), 12 states have return successors, (27), 17 states have call predecessors, (27), 19 states have call successors, (27) Word has length 357 [2025-01-09 04:10:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:50,380 INFO L225 Difference]: With dead ends: 1242 [2025-01-09 04:10:50,380 INFO L226 Difference]: Without dead ends: 752 [2025-01-09 04:10:50,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 496 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3108 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1009, Invalid=13033, Unknown=0, NotChecked=0, Total=14042 [2025-01-09 04:10:50,385 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 545 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 3536 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 3536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:50,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 377 Invalid, 3690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 3536 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:10:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-01-09 04:10:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 742. [2025-01-09 04:10:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 630 states have (on average 1.1968253968253968) internal successors, (754), 649 states have internal predecessors, (754), 63 states have call successors, (63), 49 states have call predecessors, (63), 48 states have return successors, (159), 43 states have call predecessors, (159), 61 states have call successors, (159) [2025-01-09 04:10:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 976 transitions. [2025-01-09 04:10:50,453 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 976 transitions. Word has length 357 [2025-01-09 04:10:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:50,454 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 976 transitions. [2025-01-09 04:10:50,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 50 states have (on average 3.88) internal successors, (194), 46 states have internal predecessors, (194), 28 states have call successors, (40), 17 states have call predecessors, (40), 12 states have return successors, (27), 17 states have call predecessors, (27), 19 states have call successors, (27) [2025-01-09 04:10:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 976 transitions. [2025-01-09 04:10:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2025-01-09 04:10:50,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:50,466 INFO L218 NwaCegarLoop]: trace histogram [59, 54, 50, 50, 50, 50, 50, 49, 49, 49, 46, 45, 30, 30, 20, 20, 13, 12, 10, 10, 9, 9, 9, 9, 9, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:50,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 04:10:50,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 04:10:50,671 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:50,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1634932373, now seen corresponding path program 3 times [2025-01-09 04:10:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:50,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354339936] [2025-01-09 04:10:50,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:50,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:50,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 845 statements into 13 equivalence classes. [2025-01-09 04:10:50,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 845 statements. [2025-01-09 04:10:50,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 04:10:50,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18888 backedges. 985 proven. 3 refuted. 0 times theorem prover too weak. 17900 trivial. 0 not checked. [2025-01-09 04:10:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354339936] [2025-01-09 04:10:51,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354339936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554984186] [2025-01-09 04:10:51,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:51,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:10:51,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 04:10:51,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 845 statements into 13 equivalence classes. [2025-01-09 04:10:51,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 845 statements. [2025-01-09 04:10:51,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 04:10:51,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:51,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 04:10:51,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:52,249 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 53 treesize of output 41 [2025-01-09 04:10:52,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 04:10:52,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 61 [2025-01-09 04:10:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18888 backedges. 985 proven. 3 refuted. 0 times theorem prover too weak. 17900 trivial. 0 not checked. [2025-01-09 04:10:52,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:52,668 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 34 treesize of output 26 [2025-01-09 04:10:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 18888 backedges. 985 proven. 3 refuted. 0 times theorem prover too weak. 17900 trivial. 0 not checked. [2025-01-09 04:10:54,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554984186] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:54,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:54,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2025-01-09 04:10:54,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829984156] [2025-01-09 04:10:54,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:54,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:10:54,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:54,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:10:54,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:10:54,105 INFO L87 Difference]: Start difference. First operand 742 states and 976 transitions. Second operand has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:10:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:54,878 INFO L93 Difference]: Finished difference Result 1986 states and 2849 transitions. [2025-01-09 04:10:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:10:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 845 [2025-01-09 04:10:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:54,884 INFO L225 Difference]: With dead ends: 1986 [2025-01-09 04:10:54,885 INFO L226 Difference]: Without dead ends: 1247 [2025-01-09 04:10:54,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1707 GetRequests, 1679 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:10:54,887 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 62 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:54,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 603 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:10:54,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2025-01-09 04:10:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1169. [2025-01-09 04:10:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 996 states have (on average 1.1475903614457832) internal successors, (1143), 1038 states have internal predecessors, (1143), 104 states have call successors, (104), 72 states have call predecessors, (104), 68 states have return successors, (260), 58 states have call predecessors, (260), 102 states have call successors, (260) [2025-01-09 04:10:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1507 transitions. [2025-01-09 04:10:54,977 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1507 transitions. Word has length 845 [2025-01-09 04:10:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:54,978 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1507 transitions. [2025-01-09 04:10:54,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 18 states have internal predecessors, (79), 4 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:10:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1507 transitions. [2025-01-09 04:10:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2025-01-09 04:10:54,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:54,992 INFO L218 NwaCegarLoop]: trace histogram [59, 54, 50, 50, 50, 50, 50, 49, 49, 49, 45, 43, 40, 40, 13, 12, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:55,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 04:10:55,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:55,197 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:55,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:55,198 INFO L85 PathProgramCache]: Analyzing trace with hash -611153391, now seen corresponding path program 4 times [2025-01-09 04:10:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:55,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731811396] [2025-01-09 04:10:55,198 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:10:55,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:55,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 845 statements into 2 equivalence classes. [2025-01-09 04:10:56,390 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 845 of 845 statements. [2025-01-09 04:10:56,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 04:10:56,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18888 backedges. 2803 proven. 3247 refuted. 0 times theorem prover too weak. 12838 trivial. 0 not checked. [2025-01-09 04:11:07,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:11:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731811396] [2025-01-09 04:11:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731811396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739006641] [2025-01-09 04:11:07,459 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:11:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:07,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:07,465 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:11:07,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 04:11:07,882 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 845 statements into 2 equivalence classes. [2025-01-09 04:11:11,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 845 of 845 statements. [2025-01-09 04:11:11,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 04:11:11,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:11,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 6049 conjuncts, 362 conjuncts are in the unsatisfiable core [2025-01-09 04:11:11,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:11:11,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:11:12,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:11:12,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:11:13,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 04:11:14,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 04:11:15,540 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 15 [2025-01-09 04:11:15,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 04:11:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18888 backedges. 10779 proven. 918 refuted. 0 times theorem prover too weak. 7191 trivial. 0 not checked. [2025-01-09 04:11:17,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:11:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739006641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:19,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:11:19,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 42] total 65 [2025-01-09 04:11:19,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442666449] [2025-01-09 04:11:19,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:11:19,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-01-09 04:11:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:11:19,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-01-09 04:11:19,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=4415, Unknown=0, NotChecked=0, Total=4692 [2025-01-09 04:11:19,836 INFO L87 Difference]: Start difference. First operand 1169 states and 1507 transitions. Second operand has 65 states, 51 states have (on average 3.5294117647058822) internal successors, (180), 55 states have internal predecessors, (180), 27 states have call successors, (37), 13 states have call predecessors, (37), 24 states have return successors, (36), 25 states have call predecessors, (36), 22 states have call successors, (36)