./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_mannadiv.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_mannadiv.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 305ef194ca8c72f4da0a6deb18ed40b72305718d65c18a21aa3fcb3830c499e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:04:31,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:04:31,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:04:31,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:04:31,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:04:31,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:04:31,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:04:31,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:04:31,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:04:31,510 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:04:31,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:04:31,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:04:31,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:04:31,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:04:31,511 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:04:31,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:04:31,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:04:31,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:04:31,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:04:31,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:04:31,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:04:31,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:04:31,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:04:31,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:04:31,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:04:31,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:04:31,514 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 -> 305ef194ca8c72f4da0a6deb18ed40b72305718d65c18a21aa3fcb3830c499e5 [2025-02-05 16:04:31,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:04:31,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:04:31,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:04:31,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:04:31,754 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:04:31,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_mannadiv.c [2025-02-05 16:04:32,856 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eef8b4fa9/eca30aab1c494215b9ac4edcc483d966/FLAG04ffe8135 [2025-02-05 16:04:33,054 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:04:33,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_mannadiv.c [2025-02-05 16:04:33,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eef8b4fa9/eca30aab1c494215b9ac4edcc483d966/FLAG04ffe8135 [2025-02-05 16:04:33,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eef8b4fa9/eca30aab1c494215b9ac4edcc483d966 [2025-02-05 16:04:33,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:04:33,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:04:33,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:04:33,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:04:33,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:04:33,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33, skipping insertion in model container [2025-02-05 16:04:33,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:04:33,190 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_nla-digbench/recursified_mannadiv.c[1105,1118] [2025-02-05 16:04:33,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:04:33,214 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:04:33,220 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_nla-digbench/recursified_mannadiv.c[1105,1118] [2025-02-05 16:04:33,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:04:33,240 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:04:33,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33 WrapperNode [2025-02-05 16:04:33,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:04:33,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:04:33,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:04:33,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:04:33,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,268 INFO L138 Inliner]: procedures = 16, calls = 57, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-02-05 16:04:33,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:04:33,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:04:33,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:04:33,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:04:33,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,289 INFO L175 MemorySlicer]: Split 31 memory accesses to 6 slices as follows [5, 2, 7, 5, 5, 7]. 23 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0, 0, 0]. The 10 writes are split as follows [2, 0, 3, 1, 1, 3]. [2025-02-05 16:04:33,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:04:33,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:04:33,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:04:33,306 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:04:33,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (1/1) ... [2025-02-05 16:04:33,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:04:33,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:04:33,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:04:33,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:04:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:04:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:04:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:04:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:04:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:04:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:04:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:04:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:04:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_42_0 [2025-02-05 16:04:33,346 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_42_0 [2025-02-05 16:04:33,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:04:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:04:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:04:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:04:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:04:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:04:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:04:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:04:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 16:04:33,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 16:04:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:04:33,405 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:04:33,407 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:04:33,524 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: call ULTIMATE.dealloc(main_~#x1~0#1.base, main_~#x1~0#1.offset);havoc main_~#x1~0#1.base, main_~#x1~0#1.offset;call ULTIMATE.dealloc(main_~#x2~0#1.base, main_~#x2~0#1.offset);havoc main_~#x2~0#1.base, main_~#x2~0#1.offset;call ULTIMATE.dealloc(main_~#y1~0#1.base, main_~#y1~0#1.offset);havoc main_~#y1~0#1.base, main_~#y1~0#1.offset;call ULTIMATE.dealloc(main_~#y2~0#1.base, main_~#y2~0#1.offset);havoc main_~#y2~0#1.base, main_~#y2~0#1.offset;call ULTIMATE.dealloc(main_~#y3~0#1.base, main_~#y3~0#1.offset);havoc main_~#y3~0#1.base, main_~#y3~0#1.offset; [2025-02-05 16:04:33,536 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-05 16:04:33,537 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:04:33,544 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:04:33,546 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:04:33,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:04:33 BoogieIcfgContainer [2025-02-05 16:04:33,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:04:33,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:04:33,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:04:33,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:04:33,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:04:33" (1/3) ... [2025-02-05 16:04:33,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b76b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:04:33, skipping insertion in model container [2025-02-05 16:04:33,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:04:33" (2/3) ... [2025-02-05 16:04:33,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b76b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:04:33, skipping insertion in model container [2025-02-05 16:04:33,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:04:33" (3/3) ... [2025-02-05 16:04:33,554 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_mannadiv.c [2025-02-05 16:04:33,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:04:33,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_mannadiv.c that has 4 procedures, 32 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:04:33,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:04:33,619 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;@615d9a03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:04:33,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:04:33,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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-02-05 16:04:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 16:04:33,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:04:33,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:04:33,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:04:33,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:04:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash 400110472, now seen corresponding path program 1 times [2025-02-05 16:04:33,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:04:33,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995349434] [2025-02-05 16:04:33,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:33,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:04:33,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 16:04:33,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 16:04:33,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:33,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:04:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:04:33,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:04:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995349434] [2025-02-05 16:04:33,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995349434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:04:33,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559238407] [2025-02-05 16:04:33,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:33,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:04:33,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:04:33,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:04:33,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:04:33,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 16:04:33,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 16:04:33,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:33,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:04:33,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 16:04:33,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:04:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:04:33,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:04:33,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559238407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:04:33,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:04:33,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 16:04:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741954224] [2025-02-05 16:04:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:04:33,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:04:33,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:04:33,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:04:33,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:04:33,958 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 16:04:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:04:33,972 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2025-02-05 16:04:33,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:04:33,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-02-05 16:04:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:04:33,977 INFO L225 Difference]: With dead ends: 61 [2025-02-05 16:04:33,977 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 16:04:33,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:04:33,980 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:04:33,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:04:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 16:04:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 16:04:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 16:04:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-02-05 16:04:34,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 21 [2025-02-05 16:04:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:04:34,003 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-02-05 16:04:34,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 16:04:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-02-05 16:04:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 16:04:34,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:04:34,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:04:34,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:04:34,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 16:04:34,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:04:34,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:04:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -43531190, now seen corresponding path program 1 times [2025-02-05 16:04:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:04:34,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309515186] [2025-02-05 16:04:34,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:04:34,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 16:04:34,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 16:04:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:34,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 16:04:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206697532] [2025-02-05 16:04:34,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:34,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:04:34,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:04:34,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:04:34,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:04:34,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 16:04:34,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 16:04:34,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:34,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:04:34,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-05 16:04:34,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:04:34,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:04:34,416 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-02-05 16:04:34,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 16:04:34,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-05 16:04:34,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:04:34,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-05 16:04:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:04:34,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:04:34,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:04:34,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309515186] [2025-02-05 16:04:34,591 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 16:04:34,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206697532] [2025-02-05 16:04:34,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206697532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:04:34,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:04:34,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:04:34,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203517786] [2025-02-05 16:04:34,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:04:34,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:04:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:04:34,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:04:34,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:04:34,593 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 16:04:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:04:34,728 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-02-05 16:04:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:04:34,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-05 16:04:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:04:34,729 INFO L225 Difference]: With dead ends: 43 [2025-02-05 16:04:34,729 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 16:04:34,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:04:34,730 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:04:34,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 135 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:04:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 16:04:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-02-05 16:04:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 28 states have internal predecessors, (30), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-05 16:04:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-05 16:04:34,736 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 21 [2025-02-05 16:04:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:04:34,736 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-05 16:04:34,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 16:04:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-05 16:04:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 16:04:34,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:04:34,737 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] [2025-02-05 16:04:34,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:04:34,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:04:34,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:04:34,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:04:34,940 INFO L85 PathProgramCache]: Analyzing trace with hash -957776969, now seen corresponding path program 1 times [2025-02-05 16:04:34,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:04:34,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513715523] [2025-02-05 16:04:34,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:04:34,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 16:04:34,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 16:04:34,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:34,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 16:04:34,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235165450] [2025-02-05 16:04:34,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:34,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:04:34,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:04:34,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:04:34,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:04:35,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 16:04:35,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 16:04:35,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:04:35,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 16:04:35,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:04:35,072 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-02-05 16:04:35,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-05 16:04:35,083 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-02-05 16:04:35,110 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 11 treesize of output 7 [2025-02-05 16:04:35,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-05 16:04:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:04:35,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:04:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:04:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513715523] [2025-02-05 16:04:35,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 16:04:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235165450] [2025-02-05 16:04:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235165450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:04:35,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:04:35,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:04:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106308323] [2025-02-05 16:04:35,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:04:35,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:04:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:04:35,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:04:35,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:04:35,298 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 16:04:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:04:35,485 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2025-02-05 16:04:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:04:35,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2025-02-05 16:04:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:04:35,487 INFO L225 Difference]: With dead ends: 49 [2025-02-05 16:04:35,488 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 16:04:35,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:04:35,488 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:04:35,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:04:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 16:04:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-02-05 16:04:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-05 16:04:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2025-02-05 16:04:35,494 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 31 [2025-02-05 16:04:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:04:35,494 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2025-02-05 16:04:35,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 16:04:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2025-02-05 16:04:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 16:04:35,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:04:35,498 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 16:04:35,504 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-02-05 16:04:35,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:04:35,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:04:35,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:04:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1095755543, now seen corresponding path program 1 times [2025-02-05 16:04:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:04:35,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464113153] [2025-02-05 16:04:35,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:35,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:04:35,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 16:04:35,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 16:04:35,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:35,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 16:04:35,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493915208] [2025-02-05 16:04:35,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:04:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:04:35,765 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:04:35,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:04:35,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 16:04:35,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 16:04:35,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:35,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:04:35,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 129 conjuncts are in the unsatisfiable core [2025-02-05 16:04:35,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:04:35,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:04:35,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:04:35,867 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-02-05 16:04:35,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-05 16:04:35,877 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-02-05 16:04:36,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:04:36,078 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 29 treesize of output 17 [2025-02-05 16:04:36,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:04:36,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-05 16:04:36,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-05 16:04:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:04:36,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:04:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:04:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:04:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464113153] [2025-02-05 16:04:36,520 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 16:04:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493915208] [2025-02-05 16:04:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493915208] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:04:36,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 16:04:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2025-02-05 16:04:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674973201] [2025-02-05 16:04:36,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 16:04:36,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:04:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:04:36,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:04:36,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:04:36,522 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 16:04:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:04:37,126 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2025-02-05 16:04:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 16:04:37,127 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2025-02-05 16:04:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:04:37,128 INFO L225 Difference]: With dead ends: 60 [2025-02-05 16:04:37,128 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 16:04:37,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:04:37,129 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:04:37,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 264 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:04:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 16:04:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2025-02-05 16:04:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 9 states have call successors, (9), 7 states have call predecessors, (9), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-05 16:04:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-02-05 16:04:37,138 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 32 [2025-02-05 16:04:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:04:37,139 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-02-05 16:04:37,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 9 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 16:04:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-02-05 16:04:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:04:37,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:04:37,140 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:04:37,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:04:37,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:04:37,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:04:37,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:04:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1146121770, now seen corresponding path program 1 times [2025-02-05 16:04:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:04:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295588143] [2025-02-05 16:04:37,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:04:37,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:04:37,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:04:37,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:37,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 16:04:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848521617] [2025-02-05 16:04:37,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:04:37,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:04:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:04:37,412 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:04:37,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:04:37,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:04:37,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:04:37,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:04:37,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:04:37,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 147 conjuncts are in the unsatisfiable core [2025-02-05 16:04:37,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:04:37,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:04:37,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:04:37,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-05 16:04:37,532 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-02-05 16:04:37,537 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-02-05 16:04:37,556 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 11 treesize of output 7 [2025-02-05 16:04:37,914 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 13 treesize of output 9 [2025-02-05 16:04:38,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:04:38,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:04:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:04:38,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:04:39,678 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 68 treesize of output 60 [2025-02-05 16:04:39,688 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 60 treesize of output 56 [2025-02-05 16:04:39,694 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 56 treesize of output 52 [2025-02-05 16:05:29,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:05:29,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295588143] [2025-02-05 16:05:29,470 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 16:05:29,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848521617] [2025-02-05 16:05:29,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848521617] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:05:29,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:05:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2025-02-05 16:05:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083472993] [2025-02-05 16:05:29,470 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 16:05:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 16:05:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:05:29,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 16:05:29,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=613, Unknown=11, NotChecked=0, Total=702 [2025-02-05 16:05:29,471 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 16:05:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:05:30,682 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-02-05 16:05:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:05:30,683 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-02-05 16:05:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:05:30,684 INFO L225 Difference]: With dead ends: 61 [2025-02-05 16:05:30,684 INFO L226 Difference]: Without dead ends: 51 [2025-02-05 16:05:30,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 50.6s TimeCoverageRelationStatistics Valid=150, Invalid=1171, Unknown=11, NotChecked=0, Total=1332 [2025-02-05 16:05:30,685 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:05:30,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 106 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:05:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-05 16:05:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-05 16:05:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (14), 8 states have call predecessors, (14), 9 states have call successors, (14) [2025-02-05 16:05:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-02-05 16:05:30,699 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 44 [2025-02-05 16:05:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:05:30,700 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-02-05 16:05:30,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 6 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 16:05:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-02-05 16:05:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:05:30,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:05:30,702 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:05:30,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:05:30,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:05:30,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:05:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:05:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash 737297545, now seen corresponding path program 1 times [2025-02-05 16:05:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:05:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123325488] [2025-02-05 16:05:30,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:05:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:05:30,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:05:30,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:05:30,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:05:30,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 16:05:30,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448311735] [2025-02-05 16:05:30,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:05:30,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:05:30,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:05:30,939 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-02-05 16:05:30,939 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-02-05 16:05:30,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:05:31,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:05:31,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:05:31,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:05:31,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 149 conjuncts are in the unsatisfiable core [2025-02-05 16:05:31,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:05:31,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:05:31,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:05:31,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-05 16:05:31,061 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-02-05 16:05:31,069 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-02-05 16:05:31,097 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 11 treesize of output 7 [2025-02-05 16:05:31,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:05:31,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:05:32,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 16:05:32,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2025-02-05 16:05:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:05:32,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:05:33,656 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 57 treesize of output 49 [2025-02-05 16:05:33,664 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 49 treesize of output 41 [2025-02-05 16:05:33,672 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 41 treesize of output 37 [2025-02-05 16:05:37,697 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((|v_func_to_recursive_line_31_to_42_0_#in~x1.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~x2.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~x1.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~x2.offset_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_int#3| |v_func_to_recursive_line_31_to_42_0_#in~x1.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~x1.offset_BEFORE_CALL_8|) (+ (select (select |c_#memory_int#2| |v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_8|) (* (select (select |c_#memory_int#0| |v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_31_to_42_0_#in~x2.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~x2.offset_BEFORE_CALL_8|))))))) (and (forall ((|v_func_to_recursive_line_31_to_42_0_#in~x1.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~x2.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~x1.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_31_to_42_0_#in~x2.offset_BEFORE_CALL_8| Int)) (let ((.cse1 (select (select |c_#memory_int#4| |v_func_to_recursive_line_31_to_42_0_#in~x2.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~x2.offset_BEFORE_CALL_8|)) (.cse0 (select (select |c_#memory_int#3| |v_func_to_recursive_line_31_to_42_0_#in~x1.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~x1.offset_BEFORE_CALL_8|))) (or (= .cse0 (+ (select (select |c_#memory_int#2| |v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_8|) (* (select (select |c_#memory_int#0| |v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_8|) .cse1))) (not (= (+ (select (select |c_old(#memory_int#2)| |v_func_to_recursive_line_31_to_42_0_#in~y2.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~y2.offset_BEFORE_CALL_8|) (* (select (select |c_old(#memory_int#0)| |v_func_to_recursive_line_31_to_42_0_#in~y1.base_BEFORE_CALL_8|) |v_func_to_recursive_line_31_to_42_0_#in~y1.offset_BEFORE_CALL_8|) .cse1)) .cse0))))) (or .cse2 (< (+ (select (select |c_old(#memory_int#2)| |c_func_to_recursive_line_31_to_42_0_#in~y2.base|) |c_func_to_recursive_line_31_to_42_0_#in~y2.offset|) (* (select (select |c_old(#memory_int#0)| |c_func_to_recursive_line_31_to_42_0_#in~y1.base|) |c_func_to_recursive_line_31_to_42_0_#in~y1.offset|) (select (select |c_#memory_int#4| |c_func_to_recursive_line_31_to_42_0_#in~x2.base|) |c_func_to_recursive_line_31_to_42_0_#in~x2.offset|))) (+ 1 (select (select |c_#memory_int#3| |c_func_to_recursive_line_31_to_42_0_#in~x1.base|) |c_func_to_recursive_line_31_to_42_0_#in~x1.offset|)))) (or .cse2 (= (select (select |c_old(#memory_int#5)| |c_func_to_recursive_line_31_to_42_0_#in~y3.base|) |c_func_to_recursive_line_31_to_42_0_#in~y3.offset|) 0)))) is different from false [2025-02-05 16:05:38,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:05:38,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123325488] [2025-02-05 16:05:38,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 16:05:38,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448311735] [2025-02-05 16:05:38,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448311735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:05:38,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:05:38,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2025-02-05 16:05:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085383301] [2025-02-05 16:05:38,155 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 16:05:38,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:05:38,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:05:38,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:05:38,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=777, Unknown=1, NotChecked=56, Total=930 [2025-02-05 16:05:38,157 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 22 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 16:05:42,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 16:05:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:05:43,420 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-02-05 16:05:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:05:43,421 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2025-02-05 16:05:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:05:43,422 INFO L225 Difference]: With dead ends: 59 [2025-02-05 16:05:43,422 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 16:05:43,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=189, Invalid=1536, Unknown=1, NotChecked=80, Total=1806 [2025-02-05 16:05:43,425 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:05:43,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 114 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 16:05:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 16:05:43,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-02-05 16:05:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-02-05 16:05:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-02-05 16:05:43,442 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 44 [2025-02-05 16:05:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:05:43,442 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-02-05 16:05:43,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 16:05:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-02-05 16:05:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:05:43,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:05:43,443 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:05:43,452 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-02-05 16:05:43,643 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,SelfDestructingSolverStorable5 [2025-02-05 16:05:43,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:05:43,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:05:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1086527901, now seen corresponding path program 2 times [2025-02-05 16:05:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:05:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937527900] [2025-02-05 16:05:43,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:05:43,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:05:43,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-05 16:05:43,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:05:43,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:05:43,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 16:05:43,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [134308399] [2025-02-05 16:05:43,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:05:43,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:05:43,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:05:43,696 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-02-05 16:05:43,698 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-02-05 16:05:43,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-02-05 16:05:43,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:05:43,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 16:05:43,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:05:43,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 210 conjuncts are in the unsatisfiable core [2025-02-05 16:05:43,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:05:43,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:05:43,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-05 16:05:43,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-05 16:05:43,819 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-02-05 16:05:43,831 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-02-05 16:05:43,858 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 11 treesize of output 7 [2025-02-05 16:05:44,282 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 13 treesize of output 9 [2025-02-05 16:05:44,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-05 16:05:45,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:05:45,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 16:05:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 16:05:45,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:05:48,714 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 49 treesize of output 41 [2025-02-05 16:05:48,724 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 41 treesize of output 37 [2025-02-05 16:05:48,733 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 37 treesize of output 33