./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.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_nested_3.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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:10:07,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:10:07,395 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:07,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:10:07,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:10:07,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:10:07,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:10:07,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:10:07,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:10:07,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:10:07,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:10:07,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:10:07,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:10:07,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:10:07,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:10:07,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:07,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:07,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:10:07,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:10:07,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:10:07,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:10:07,434 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2025-01-09 04:10:07,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:10:07,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:10:07,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:10:07,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:10:07,715 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:10:07,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-01-09 04:10:08,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e3fd0207/3f3b9c1ec43b4b3fbc31f19b2a0856fe/FLAGf7ce7bf64 [2025-01-09 04:10:09,207 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:10:09,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2025-01-09 04:10:09,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e3fd0207/3f3b9c1ec43b4b3fbc31f19b2a0856fe/FLAGf7ce7bf64 [2025-01-09 04:10:09,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e3fd0207/3f3b9c1ec43b4b3fbc31f19b2a0856fe [2025-01-09 04:10:09,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:10:09,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:10:09,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:09,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:10:09,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:10:09,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:09" (1/1) ... [2025-01-09 04:10:09,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d70594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:09, skipping insertion in model container [2025-01-09 04:10:09,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:09" (1/1) ... [2025-01-09 04:10:09,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:10:09,630 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_nested_3.c[1963,1976] [2025-01-09 04:10:09,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:09,641 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:10:09,653 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_nested_3.c[1963,1976] [2025-01-09 04:10:09,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:09,665 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:10:09,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:09 WrapperNode [2025-01-09 04:10:09,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:09,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:09,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:10:09,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:10:09,673 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:09" (1/1) ... [2025-01-09 04:10:09,677 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:09" (1/1) ... [2025-01-09 04:10:09,689 INFO L138 Inliner]: procedures = 14, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2025-01-09 04:10:09,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:09,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:10:09,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:10:09,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:10:09,695 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:09" (1/1) ... [2025-01-09 04:10:09,696 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:09" (1/1) ... [2025-01-09 04:10:09,697 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:09" (1/1) ... [2025-01-09 04:10:09,709 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2025-01-09 04:10:09,709 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:09" (1/1) ... [2025-01-09 04:10:09,709 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:09" (1/1) ... [2025-01-09 04:10:09,714 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:09" (1/1) ... [2025-01-09 04:10:09,717 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:09" (1/1) ... [2025-01-09 04:10:09,718 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:09" (1/1) ... [2025-01-09 04:10:09,719 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:09" (1/1) ... [2025-01-09 04:10:09,719 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:09" (1/1) ... [2025-01-09 04:10:09,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:10:09,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:10:09,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:10:09,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:10:09,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:09" (1/1) ... [2025-01-09 04:10:09,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:09,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:09,755 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:09,758 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:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:10:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:10:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:10:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:10:09,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2025-01-09 04:10:09,775 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-01-09 04:10:09,775 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:10:09,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:10:09,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:10:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:10:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2025-01-09 04:10:09,776 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2025-01-09 04:10:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:10:09,825 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:10:09,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:10:09,940 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 04:10:09,940 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:10:09,947 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:10:09,948 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:10:09,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:09 BoogieIcfgContainer [2025-01-09 04:10:09,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:10:09,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:10:09,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:10:09,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:10:09,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:10:09" (1/3) ... [2025-01-09 04:10:09,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c7bff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:09, skipping insertion in model container [2025-01-09 04:10:09,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:09" (2/3) ... [2025-01-09 04:10:09,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c7bff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:09, skipping insertion in model container [2025-01-09 04:10:09,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:09" (3/3) ... [2025-01-09 04:10:09,956 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2025-01-09 04:10:09,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:10:09,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_3.c that has 4 procedures, 33 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:10:10,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:10:10,012 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;@1a0ba000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:10:10,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:10:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:10:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 04:10:10,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:10,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:10,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:10,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash 58732503, now seen corresponding path program 1 times [2025-01-09 04:10:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916451471] [2025-01-09 04:10:10,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:10,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 04:10:10,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 04:10:10,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:10,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:10,429 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:10,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:10,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916451471] [2025-01-09 04:10:10,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916451471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:10,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:10,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592486645] [2025-01-09 04:10:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:10,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:10,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:10,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:10,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:10,453 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:10,566 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2025-01-09 04:10:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:10,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-01-09 04:10:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:10,573 INFO L225 Difference]: With dead ends: 46 [2025-01-09 04:10:10,573 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 04:10:10,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:10,579 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:10,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 04:10:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-09 04:10:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-09 04:10:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-01-09 04:10:10,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 13 [2025-01-09 04:10:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:10,626 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-01-09 04:10:10,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-01-09 04:10:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 04:10:10,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:10,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:10,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:10:10,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:10,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1518425104, now seen corresponding path program 1 times [2025-01-09 04:10:10,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:10,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925910167] [2025-01-09 04:10:10,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:10,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:10,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 04:10:10,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 04:10:10,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:10,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:10:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:10,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925910167] [2025-01-09 04:10:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925910167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:10,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:10,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338260195] [2025-01-09 04:10:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:10,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:10,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:10,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:10,863 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:10:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:10,957 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2025-01-09 04:10:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-01-09 04:10:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:10,958 INFO L225 Difference]: With dead ends: 61 [2025-01-09 04:10:10,958 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 04:10:10,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:10,960 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:10,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 82 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 04:10:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-01-09 04:10:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 04:10:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-01-09 04:10:10,969 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2025-01-09 04:10:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:10,969 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-01-09 04:10:10,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:10:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-01-09 04:10:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 04:10:10,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:10,971 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:10:10,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:10:10,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:10,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1549340056, now seen corresponding path program 1 times [2025-01-09 04:10:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409336089] [2025-01-09 04:10:10,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:10,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:10,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 04:10:10,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 04:10:11,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:11,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:10:11,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409336089] [2025-01-09 04:10:11,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409336089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:11,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:11,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379642694] [2025-01-09 04:10:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:11,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:11,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:11,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:11,184 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:10:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:11,259 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2025-01-09 04:10:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:11,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2025-01-09 04:10:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:11,262 INFO L225 Difference]: With dead ends: 65 [2025-01-09 04:10:11,264 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 04:10:11,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:11,265 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:11,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 04:10:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-09 04:10:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 04:10:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-01-09 04:10:11,275 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 35 [2025-01-09 04:10:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:11,275 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-01-09 04:10:11,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:10:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-01-09 04:10:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 04:10:11,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:11,276 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, 1, 1] [2025-01-09 04:10:11,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:10:11,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1995545220, now seen corresponding path program 1 times [2025-01-09 04:10:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340699428] [2025-01-09 04:10:11,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:11,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:10:11,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:10:11,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:11,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:10:11,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340699428] [2025-01-09 04:10:11,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340699428] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836439770] [2025-01-09 04:10:11,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:11,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:11,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:11,598 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:11,600 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:11,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:10:11,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:10:11,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:11,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:11,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:10:11,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:11,720 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:11,797 WARN L873 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_21_to_22_0_~a.offset Int)) (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_21_to_22_0_#in~a.base|) func_to_recursive_line_21_to_22_0_~a.offset)) (.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_21_to_22_0_#in~a.base|))) (and (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_21_to_22_0_#in~a.base| (store .cse0 func_to_recursive_line_21_to_22_0_~a.offset .cse1)) |c_#memory_int#2|) (<= .cse1 (+ (select .cse0 func_to_recursive_line_21_to_22_0_~a.offset) 1))))) is different from true [2025-01-09 04:10:11,855 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-01-09 04:10:11,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 32 [2025-01-09 04:10:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2025-01-09 04:10:11,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836439770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:12,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2025-01-09 04:10:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449674215] [2025-01-09 04:10:12,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:12,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:10:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:12,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:10:12,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-01-09 04:10:12,016 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 15 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 7 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 04:10:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:12,259 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2025-01-09 04:10:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:10:12,260 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 7 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 40 [2025-01-09 04:10:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:12,260 INFO L225 Difference]: With dead ends: 79 [2025-01-09 04:10:12,260 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 04:10:12,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2025-01-09 04:10:12,262 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:12,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 109 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 218 Invalid, 0 Unknown, 116 Unchecked, 0.1s Time] [2025-01-09 04:10:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 04:10:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-01-09 04:10:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 04:10:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-01-09 04:10:12,268 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 40 [2025-01-09 04:10:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:12,268 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-01-09 04:10:12,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.5) internal successors, (42), 13 states have internal predecessors, (42), 7 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 04:10:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-01-09 04:10:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:10:12,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:12,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:10:12,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:10:12,473 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:12,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:12,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1008547690, now seen corresponding path program 1 times [2025-01-09 04:10:12,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:12,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184557032] [2025-01-09 04:10:12,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:12,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:10:12,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:10:12,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:12,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:10:12,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:12,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184557032] [2025-01-09 04:10:12,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184557032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:12,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:12,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:10:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065593879] [2025-01-09 04:10:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:12,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:10:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:12,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:10:12,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:10:12,548 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:10:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:12,563 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-01-09 04:10:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:10:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2025-01-09 04:10:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:12,564 INFO L225 Difference]: With dead ends: 49 [2025-01-09 04:10:12,564 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 04:10:12,564 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:12,565 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:12,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 04:10:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-01-09 04:10:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 04:10:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-01-09 04:10:12,570 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 45 [2025-01-09 04:10:12,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:12,570 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-01-09 04:10:12,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 04:10:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-01-09 04:10:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 04:10:12,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:12,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:10:12,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:10:12,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:12,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1008545768, now seen corresponding path program 1 times [2025-01-09 04:10:12,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:12,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234125637] [2025-01-09 04:10:12,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:12,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:10:12,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:10:12,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:12,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:10:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:13,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234125637] [2025-01-09 04:10:13,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234125637] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:13,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062087480] [2025-01-09 04:10:13,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:13,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:13,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:13,086 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:13,087 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:13,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 04:10:13,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 04:10:13,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:13,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:13,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 04:10:13,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:13,173 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:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:10:13,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:10:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062087480] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:13,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:13,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2025-01-09 04:10:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272866978] [2025-01-09 04:10:13,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:13,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:10:13,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:13,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:10:13,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:10:13,888 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 27 states, 20 states have (on average 2.55) internal successors, (51), 23 states have internal predecessors, (51), 11 states have call successors, (15), 6 states have call predecessors, (15), 9 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 04:10:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:14,295 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2025-01-09 04:10:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:10:14,296 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 2.55) internal successors, (51), 23 states have internal predecessors, (51), 11 states have call successors, (15), 6 states have call predecessors, (15), 9 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) Word has length 45 [2025-01-09 04:10:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:14,296 INFO L225 Difference]: With dead ends: 89 [2025-01-09 04:10:14,296 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 04:10:14,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=1198, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 04:10:14,297 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:14,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 254 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 04:10:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 04:10:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 10 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 04:10:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-01-09 04:10:14,308 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 45 [2025-01-09 04:10:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:14,308 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-01-09 04:10:14,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 2.55) internal successors, (51), 23 states have internal predecessors, (51), 11 states have call successors, (15), 6 states have call predecessors, (15), 9 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 04:10:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-01-09 04:10:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:10:14,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:14,310 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 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] [2025-01-09 04:10:14,316 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:14,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:14,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:14,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1442566732, now seen corresponding path program 2 times [2025-01-09 04:10:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:14,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181247295] [2025-01-09 04:10:14,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:14,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-09 04:10:14,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:10:14,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:14,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 91 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 04:10:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:15,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181247295] [2025-01-09 04:10:15,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181247295] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:15,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838579698] [2025-01-09 04:10:15,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:15,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:15,044 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,045 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,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-01-09 04:10:15,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:10:15,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:15,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:15,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 04:10:15,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:15,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 04:10:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-01-09 04:10:15,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-09 04:10:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838579698] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:16,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 28 [2025-01-09 04:10:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652400375] [2025-01-09 04:10:16,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:16,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:10:16,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:16,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:10:16,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:10:16,119 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 28 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 24 states have internal predecessors, (52), 11 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-09 04:10:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:16,535 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2025-01-09 04:10:16,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:10:16,536 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 24 states have internal predecessors, (52), 11 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) Word has length 76 [2025-01-09 04:10:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:16,537 INFO L225 Difference]: With dead ends: 93 [2025-01-09 04:10:16,537 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 04:10:16,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 04:10:16,538 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:16,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 171 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:16,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 04:10:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 04:10:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 6 states have call successors, (6), 4 states have call predecessors, (6), 11 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 04:10:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-01-09 04:10:16,546 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 76 [2025-01-09 04:10:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:16,546 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-01-09 04:10:16,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 24 states have internal predecessors, (52), 11 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-09 04:10:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-01-09 04:10:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 04:10:16,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:16,548 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:16,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:10:16,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:16,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:16,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash -909546097, now seen corresponding path program 2 times [2025-01-09 04:10:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:16,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274687494] [2025-01-09 04:10:16,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:16,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-01-09 04:10:16,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 04:10:16,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:16,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 14 proven. 389 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-01-09 04:10:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274687494] [2025-01-09 04:10:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274687494] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285501744] [2025-01-09 04:10:17,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:17,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:17,609 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:17,611 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:17,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-01-09 04:10:17,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 04:10:17,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:17,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:17,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 04:10:17,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:17,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 04:10:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2025-01-09 04:10:17,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2025-01-09 04:10:18,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285501744] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:18,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:18,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 34 [2025-01-09 04:10:18,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898357664] [2025-01-09 04:10:18,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:18,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 04:10:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:18,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 04:10:18,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:10:18,893 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 34 states, 26 states have (on average 2.269230769230769) internal successors, (59), 29 states have internal predecessors, (59), 13 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (23), 13 states have call predecessors, (23), 13 states have call successors, (23) [2025-01-09 04:10:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:19,339 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2025-01-09 04:10:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:10:19,339 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 2.269230769230769) internal successors, (59), 29 states have internal predecessors, (59), 13 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (23), 13 states have call predecessors, (23), 13 states have call successors, (23) Word has length 159 [2025-01-09 04:10:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:19,340 INFO L225 Difference]: With dead ends: 97 [2025-01-09 04:10:19,340 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 04:10:19,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=1838, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 04:10:19,342 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 82 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:19,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 191 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 04:10:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 04:10:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 04:10:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-01-09 04:10:19,348 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 159 [2025-01-09 04:10:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:19,348 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-01-09 04:10:19,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 2.269230769230769) internal successors, (59), 29 states have internal predecessors, (59), 13 states have call successors, (19), 6 states have call predecessors, (19), 13 states have return successors, (23), 13 states have call predecessors, (23), 13 states have call successors, (23) [2025-01-09 04:10:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-01-09 04:10:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-01-09 04:10:19,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:19,350 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 30, 30, 30, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:19,357 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:19,554 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,SelfDestructingSolverStorable7 [2025-01-09 04:10:19,554 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:19,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:19,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1957388480, now seen corresponding path program 3 times [2025-01-09 04:10:19,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:19,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954551388] [2025-01-09 04:10:19,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:19,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:19,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 262 statements into 11 equivalence classes. [2025-01-09 04:10:19,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 84 of 262 statements. [2025-01-09 04:10:19,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 04:10:19,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3177 backedges. 112 proven. 8 refuted. 0 times theorem prover too weak. 3057 trivial. 0 not checked. [2025-01-09 04:10:19,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:19,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954551388] [2025-01-09 04:10:19,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954551388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:19,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478997137] [2025-01-09 04:10:19,933 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:19,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:19,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:19,936 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:19,943 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:20,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 262 statements into 11 equivalence classes. [2025-01-09 04:10:20,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 84 of 262 statements. [2025-01-09 04:10:20,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 04:10:20,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:20,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-09 04:10:20,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:20,168 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:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3177 backedges. 108 proven. 8 refuted. 0 times theorem prover too weak. 3061 trivial. 0 not checked. [2025-01-09 04:10:20,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3177 backedges. 108 proven. 15 refuted. 0 times theorem prover too weak. 3054 trivial. 0 not checked. [2025-01-09 04:10:21,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478997137] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:21,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 30 [2025-01-09 04:10:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4354641] [2025-01-09 04:10:21,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:10:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:21,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:10:21,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:10:21,789 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 30 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 26 states have internal predecessors, (59), 16 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (24), 12 states have call predecessors, (24), 16 states have call successors, (24) [2025-01-09 04:10:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:22,050 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2025-01-09 04:10:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:10:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 26 states have internal predecessors, (59), 16 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (24), 12 states have call predecessors, (24), 16 states have call successors, (24) Word has length 262 [2025-01-09 04:10:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:22,051 INFO L225 Difference]: With dead ends: 108 [2025-01-09 04:10:22,051 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 04:10:22,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1097, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 04:10:22,052 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:22,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 346 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:22,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 04:10:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2025-01-09 04:10:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 37 states have internal predecessors, (40), 6 states have call successors, (6), 4 states have call predecessors, (6), 15 states have return successors, (18), 15 states have call predecessors, (18), 6 states have call successors, (18) [2025-01-09 04:10:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-01-09 04:10:22,057 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 262 [2025-01-09 04:10:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:22,058 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-01-09 04:10:22,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 26 states have internal predecessors, (59), 16 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (24), 12 states have call predecessors, (24), 16 states have call successors, (24) [2025-01-09 04:10:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-01-09 04:10:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 04:10:22,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:22,065 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 60, 60, 60, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:22,074 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:22,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:22,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:22,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1907418216, now seen corresponding path program 4 times [2025-01-09 04:10:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368487606] [2025-01-09 04:10:22,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:10:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:22,298 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 478 statements into 2 equivalence classes. [2025-01-09 04:10:22,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 477 of 478 statements. [2025-01-09 04:10:22,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:10:22,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12645 backedges. 22 proven. 1951 refuted. 0 times theorem prover too weak. 10672 trivial. 0 not checked. [2025-01-09 04:10:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368487606] [2025-01-09 04:10:24,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368487606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:24,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980522293] [2025-01-09 04:10:24,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:10:24,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:24,403 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:24,405 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:24,542 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 478 statements into 2 equivalence classes. [2025-01-09 04:10:24,712 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 477 of 478 statements. [2025-01-09 04:10:24,712 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:10:24,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:24,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-09 04:10:24,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:24,736 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:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12645 backedges. 3772 proven. 35 refuted. 0 times theorem prover too weak. 8838 trivial. 0 not checked. [2025-01-09 04:10:24,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12645 backedges. 1802 proven. 242 refuted. 0 times theorem prover too weak. 10601 trivial. 0 not checked. [2025-01-09 04:10:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980522293] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:29,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:29,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 42 [2025-01-09 04:10:29,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508095154] [2025-01-09 04:10:29,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:29,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 04:10:29,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:29,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 04:10:29,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 04:10:29,282 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (22), 9 states have call predecessors, (22), 15 states have return successors, (33), 13 states have call predecessors, (33), 12 states have call successors, (33) [2025-01-09 04:10:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:29,656 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2025-01-09 04:10:29,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:10:29,657 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (22), 9 states have call predecessors, (22), 15 states have return successors, (33), 13 states have call predecessors, (33), 12 states have call successors, (33) Word has length 478 [2025-01-09 04:10:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:29,657 INFO L225 Difference]: With dead ends: 111 [2025-01-09 04:10:29,657 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 04:10:29,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 988 GetRequests, 936 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=486, Invalid=1964, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 04:10:29,658 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:29,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 509 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 04:10:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 04:10:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 6 states have call successors, (6), 4 states have call predecessors, (6), 16 states have return successors, (19), 16 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 04:10:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-01-09 04:10:29,668 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 478 [2025-01-09 04:10:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:29,668 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-01-09 04:10:29,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (22), 9 states have call predecessors, (22), 15 states have return successors, (33), 13 states have call predecessors, (33), 12 states have call successors, (33) [2025-01-09 04:10:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-01-09 04:10:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-01-09 04:10:29,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:29,677 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 72, 72, 72, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:29,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:10:29,881 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,SelfDestructingSolverStorable9 [2025-01-09 04:10:29,881 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:29,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -269020316, now seen corresponding path program 5 times [2025-01-09 04:10:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97056254] [2025-01-09 04:10:29,882 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:10:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:29,929 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 538 statements into 23 equivalence classes. [2025-01-09 04:10:30,170 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 514 of 538 statements. [2025-01-09 04:10:30,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-01-09 04:10:30,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:33,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 68 proven. 394 refuted. 0 times theorem prover too weak. 16689 trivial. 0 not checked. [2025-01-09 04:10:33,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:33,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97056254] [2025-01-09 04:10:33,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97056254] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:33,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968418254] [2025-01-09 04:10:33,515 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:10:33,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:33,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:33,517 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:33,547 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:33,719 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 538 statements into 23 equivalence classes. [2025-01-09 04:11:04,491 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) and asserted 514 of 538 statements. [2025-01-09 04:11:04,491 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2025-01-09 04:11:04,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:04,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 2082 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-01-09 04:11:04,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:11:04,559 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:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 7728 proven. 24 refuted. 0 times theorem prover too weak. 9399 trivial. 0 not checked. [2025-01-09 04:11:04,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:11:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17151 backedges. 6 proven. 360 refuted. 0 times theorem prover too weak. 16785 trivial. 0 not checked. [2025-01-09 04:11:07,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968418254] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:11:07,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:11:07,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 22] total 38 [2025-01-09 04:11:07,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067320027] [2025-01-09 04:11:07,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:11:07,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 04:11:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:11:07,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 04:11:07,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 04:11:07,839 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 38 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 32 states have internal predecessors, (76), 17 states have call successors, (27), 8 states have call predecessors, (27), 13 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2025-01-09 04:11:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:11:08,133 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2025-01-09 04:11:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:11:08,133 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 32 states have internal predecessors, (76), 17 states have call successors, (27), 8 states have call predecessors, (27), 13 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 538 [2025-01-09 04:11:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:11:08,134 INFO L225 Difference]: With dead ends: 117 [2025-01-09 04:11:08,134 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 04:11:08,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1081 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 04:11:08,135 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:11:08,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 292 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:11:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 04:11:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 04:11:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 4 states have call predecessors, (6), 18 states have return successors, (21), 18 states have call predecessors, (21), 6 states have call successors, (21) [2025-01-09 04:11:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2025-01-09 04:11:08,141 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 538 [2025-01-09 04:11:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:11:08,141 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2025-01-09 04:11:08,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 32 states have internal predecessors, (76), 17 states have call successors, (27), 8 states have call predecessors, (27), 13 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2025-01-09 04:11:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2025-01-09 04:11:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2025-01-09 04:11:08,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:11:08,145 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 108, 108, 108, 21, 21, 18, 18, 18, 18, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:11:08,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 04:11:08,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:08,345 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:11:08,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:11:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1209438626, now seen corresponding path program 6 times [2025-01-09 04:11:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:11:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749801090] [2025-01-09 04:11:08,346 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 04:11:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:11:08,390 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 784 statements into 46 equivalence classes. [2025-01-09 04:11:08,402 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 102 of 784 statements. [2025-01-09 04:11:08,402 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-09 04:11:08,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 38610 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 38583 trivial. 0 not checked. [2025-01-09 04:11:08,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:11:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749801090] [2025-01-09 04:11:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749801090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489848905] [2025-01-09 04:11:08,908 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 04:11:08,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:08,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:08,910 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:08,912 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:09,166 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 784 statements into 46 equivalence classes. [2025-01-09 04:11:09,278 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 102 of 784 statements. [2025-01-09 04:11:09,278 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-09 04:11:09,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:09,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-09 04:11:09,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:11:09,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 04:11:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 38610 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 38587 trivial. 0 not checked. [2025-01-09 04:11:09,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:11:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 38610 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38577 trivial. 0 not checked. [2025-01-09 04:11:12,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489848905] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:11:12,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:11:12,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 18] total 42 [2025-01-09 04:11:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117310912] [2025-01-09 04:11:12,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:11:12,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 04:11:12,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:11:12,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 04:11:12,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1409, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 04:11:12,837 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 42 states, 31 states have (on average 1.935483870967742) internal successors, (60), 37 states have internal predecessors, (60), 20 states have call successors, (22), 6 states have call predecessors, (22), 12 states have return successors, (23), 19 states have call predecessors, (23), 20 states have call successors, (23) [2025-01-09 04:11:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:11:13,266 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-01-09 04:11:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:11:13,267 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 31 states have (on average 1.935483870967742) internal successors, (60), 37 states have internal predecessors, (60), 20 states have call successors, (22), 6 states have call predecessors, (22), 12 states have return successors, (23), 19 states have call predecessors, (23), 20 states have call successors, (23) Word has length 784 [2025-01-09 04:11:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:11:13,269 INFO L225 Difference]: With dead ends: 76 [2025-01-09 04:11:13,269 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 04:11:13,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1595 GetRequests, 1546 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=473, Invalid=2077, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 04:11:13,269 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 61 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:11:13,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 225 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:11:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 04:11:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 04:11:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 6 states have call successors, (6), 4 states have call predecessors, (6), 20 states have return successors, (23), 20 states have call predecessors, (23), 6 states have call successors, (23) [2025-01-09 04:11:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-01-09 04:11:13,275 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 784 [2025-01-09 04:11:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:11:13,276 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-01-09 04:11:13,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 31 states have (on average 1.935483870967742) internal successors, (60), 37 states have internal predecessors, (60), 20 states have call successors, (22), 6 states have call predecessors, (22), 12 states have return successors, (23), 19 states have call predecessors, (23), 20 states have call successors, (23) [2025-01-09 04:11:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-01-09 04:11:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1299 [2025-01-09 04:11:13,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:11:13,282 INFO L218 NwaCegarLoop]: trace histogram [210, 210, 180, 180, 180, 35, 35, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:11:13,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 04:11:13,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:13,485 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:11:13,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:11:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1156230426, now seen corresponding path program 7 times [2025-01-09 04:11:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:11:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024073090] [2025-01-09 04:11:13,486 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 04:11:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:11:13,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1298 statements into 1 equivalence classes. [2025-01-09 04:11:13,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1298 of 1298 statements. [2025-01-09 04:11:13,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:11:13,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 11 proven. 54 refuted. 0 times theorem prover too weak. 107600 trivial. 0 not checked. [2025-01-09 04:11:21,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:11:21,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024073090] [2025-01-09 04:11:21,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024073090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:21,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610021191] [2025-01-09 04:11:21,384 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 04:11:21,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:21,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:21,390 INFO L229 MonitoredProcess]: Starting monitored process 10 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:21,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 04:11:21,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1298 statements into 1 equivalence classes. [2025-01-09 04:11:22,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1298 of 1298 statements. [2025-01-09 04:11:22,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:11:22,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:22,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 5312 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 04:11:22,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:11:22,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 04:11:22,609 WARN L873 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_21_to_22_0_~a.offset Int)) (let ((.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_21_to_22_0_#in~a.base|) func_to_recursive_line_21_to_22_0_~a.offset)) (.cse0 (select |c_old(#memory_int#2)| |c_func_to_recursive_line_21_to_22_0_#in~a.base|))) (and (= (store |c_old(#memory_int#2)| |c_func_to_recursive_line_21_to_22_0_#in~a.base| (store .cse0 func_to_recursive_line_21_to_22_0_~a.offset .cse1)) |c_#memory_int#2|) (<= .cse1 (+ (select .cse0 func_to_recursive_line_21_to_22_0_~a.offset) 1))))) is different from true [2025-01-09 04:11:23,210 INFO L349 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2025-01-09 04:11:23,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 100 [2025-01-09 04:11:23,233 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 31 treesize of output 19 [2025-01-09 04:11:23,243 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 04:11:23,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 15 [2025-01-09 04:11:23,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 04:11:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 107611 trivial. 14 not checked. [2025-01-09 04:11:23,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:11:32,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610021191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:32,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:11:32,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 29 [2025-01-09 04:11:32,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346602033] [2025-01-09 04:11:32,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:11:32,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:11:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:11:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:11:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=647, Unknown=3, NotChecked=56, Total=930 [2025-01-09 04:11:32,989 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 29 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (15), 2 states have call predecessors, (15), 12 states have return successors, (19), 17 states have call predecessors, (19), 13 states have call successors, (19) [2025-01-09 04:11:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:11:33,212 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2025-01-09 04:11:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:11:33,213 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (15), 2 states have call predecessors, (15), 12 states have return successors, (19), 17 states have call predecessors, (19), 13 states have call successors, (19) Word has length 1298 [2025-01-09 04:11:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:11:33,219 INFO L225 Difference]: With dead ends: 76 [2025-01-09 04:11:33,219 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 04:11:33,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1337 GetRequests, 1305 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=224, Invalid=647, Unknown=3, NotChecked=56, Total=930 [2025-01-09 04:11:33,220 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:11:33,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 73 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 305 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2025-01-09 04:11:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 04:11:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-01-09 04:11:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 21 states have return successors, (25), 22 states have call predecessors, (25), 6 states have call successors, (25) [2025-01-09 04:11:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2025-01-09 04:11:33,238 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 1298 [2025-01-09 04:11:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:11:33,239 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2025-01-09 04:11:33,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (15), 2 states have call predecessors, (15), 12 states have return successors, (19), 17 states have call predecessors, (19), 13 states have call successors, (19) [2025-01-09 04:11:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2025-01-09 04:11:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1299 [2025-01-09 04:11:33,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:11:33,253 INFO L218 NwaCegarLoop]: trace histogram [210, 210, 180, 180, 180, 35, 35, 30, 30, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:11:33,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 04:11:33,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:33,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:11:33,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:11:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1158079390, now seen corresponding path program 3 times [2025-01-09 04:11:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:11:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632265365] [2025-01-09 04:11:33,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:11:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:11:33,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1298 statements into 88 equivalence classes. [2025-01-09 04:11:34,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) and asserted 1120 of 1298 statements. [2025-01-09 04:11:34,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2025-01-09 04:11:34,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 107665 backedges. 31 proven. 5 refuted. 0 times theorem prover too weak. 107629 trivial. 0 not checked. [2025-01-09 04:11:37,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:11:37,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632265365] [2025-01-09 04:11:37,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632265365] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:37,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829122693] [2025-01-09 04:11:37,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:11:37,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:37,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:37,028 INFO L229 MonitoredProcess]: Starting monitored process 11 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:37,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 04:11:37,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1298 statements into 88 equivalence classes.