./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/res2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/res2.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 105e7597bd9cfde6146cefe87563ba1bc48309677fb8b2f1d1f421bc92453e6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:42:35,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:42:35,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:42:35,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:42:35,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:42:35,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:42:35,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:42:35,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:42:35,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:42:35,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:42:35,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:42:35,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:42:35,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:42:35,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:42:35,785 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:42:35,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:42:35,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:42:35,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:42:35,785 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 -> 105e7597bd9cfde6146cefe87563ba1bc48309677fb8b2f1d1f421bc92453e6b [2025-01-08 22:42:35,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:42:35,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:42:35,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:42:35,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:42:35,990 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:42:35,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res2.c [2025-01-08 22:42:37,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b10f25e6/245a7349a5d64a0a93b1724f90004f20/FLAGb13773400 [2025-01-08 22:42:37,281 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:42:37,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c [2025-01-08 22:42:37,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b10f25e6/245a7349a5d64a0a93b1724f90004f20/FLAGb13773400 [2025-01-08 22:42:37,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b10f25e6/245a7349a5d64a0a93b1724f90004f20 [2025-01-08 22:42:37,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:42:37,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:42:37,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:42:37,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:42:37,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:42:37,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552f6182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37, skipping insertion in model container [2025-01-08 22:42:37,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:42:37,460 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/array-fpi/res2.c[587,600] [2025-01-08 22:42:37,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:42:37,487 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:42:37,494 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/array-fpi/res2.c[587,600] [2025-01-08 22:42:37,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:42:37,520 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:42:37,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37 WrapperNode [2025-01-08 22:42:37,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:42:37,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:42:37,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:42:37,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:42:37,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,549 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2025-01-08 22:42:37,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:42:37,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:42:37,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:42:37,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:42:37,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,566 INFO L175 MemorySlicer]: Split 23 memory accesses to 6 slices as follows [2, 7, 8, 2, 2, 2]. 35 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0, 0, 0]. The 7 writes are split as follows [0, 0, 4, 1, 1, 1]. [2025-01-08 22:42:37,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:42:37,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:42:37,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:42:37,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:42:37,584 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (1/1) ... [2025-01-08 22:42:37,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:42:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:37,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:42:37,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:42:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:42:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:42:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:42:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:42:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-08 22:42:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-08 22:42:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-08 22:42:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:42:37,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:42:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-08 22:42:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-08 22:42:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-08 22:42:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:42:37,715 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:42:37,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:42:37,854 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-08 22:42:37,856 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:42:37,863 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:42:37,864 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:42:37,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:42:37 BoogieIcfgContainer [2025-01-08 22:42:37,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:42:37,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:42:37,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:42:37,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:42:37,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:42:37" (1/3) ... [2025-01-08 22:42:37,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d43d3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:42:37, skipping insertion in model container [2025-01-08 22:42:37,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:42:37" (2/3) ... [2025-01-08 22:42:37,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d43d3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:42:37, skipping insertion in model container [2025-01-08 22:42:37,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:42:37" (3/3) ... [2025-01-08 22:42:37,872 INFO L128 eAbstractionObserver]: Analyzing ICFG res2.c [2025-01-08 22:42:37,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:42:37,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG res2.c that has 1 procedures, 18 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-08 22:42:37,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:42:37,930 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;@3e0b0ff1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:42:37,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:42:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-08 22:42:37,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:37,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:37,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:37,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1608470172, now seen corresponding path program 1 times [2025-01-08 22:42:37,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:37,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081512931] [2025-01-08 22:42:37,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:42:37,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:38,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:42:38,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:42:38,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:42:38,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081512931] [2025-01-08 22:42:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081512931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:42:38,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:42:38,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:42:38,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083296386] [2025-01-08 22:42:38,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:42:38,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:42:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:38,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:42:38,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:42:38,113 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:38,122 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2025-01-08 22:42:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:42:38,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-08 22:42:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:38,128 INFO L225 Difference]: With dead ends: 32 [2025-01-08 22:42:38,130 INFO L226 Difference]: Without dead ends: 14 [2025-01-08 22:42:38,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:42:38,135 INFO L435 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:38,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:42:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-08 22:42:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-08 22:42:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-01-08 22:42:38,156 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 13 [2025-01-08 22:42:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:38,156 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-01-08 22:42:38,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2025-01-08 22:42:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-08 22:42:38,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:38,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:38,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:42:38,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:38,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1215443162, now seen corresponding path program 1 times [2025-01-08 22:42:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:38,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312601676] [2025-01-08 22:42:38,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:42:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:38,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-08 22:42:38,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-08 22:42:38,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:42:38,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:38,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:38,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312601676] [2025-01-08 22:42:38,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312601676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:42:38,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:42:38,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:42:38,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000491048] [2025-01-08 22:42:38,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:42:38,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:42:38,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:38,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:42:38,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:42:38,308 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:38,366 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2025-01-08 22:42:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:42:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-08 22:42:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:38,367 INFO L225 Difference]: With dead ends: 28 [2025-01-08 22:42:38,367 INFO L226 Difference]: Without dead ends: 20 [2025-01-08 22:42:38,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:42:38,368 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:38,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:42:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-08 22:42:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-08 22:42:38,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-01-08 22:42:38,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2025-01-08 22:42:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:38,376 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-01-08 22:42:38,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-01-08 22:42:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-08 22:42:38,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:38,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:38,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:42:38,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:38,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1730518932, now seen corresponding path program 1 times [2025-01-08 22:42:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:38,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982464253] [2025-01-08 22:42:38,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:42:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:38,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:42:38,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:42:38,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:42:38,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982464253] [2025-01-08 22:42:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982464253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666686943] [2025-01-08 22:42:39,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:42:39,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:39,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:39,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:39,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:42:39,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-08 22:42:39,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-08 22:42:39,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:42:39,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:39,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-08 22:42:39,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:39,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:42:39,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:42:39,910 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 25 treesize of output 13 [2025-01-08 22:42:39,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:42:40,037 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 36 treesize of output 13 [2025-01-08 22:42:40,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:42:40,147 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 40 treesize of output 17 [2025-01-08 22:42:40,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-08 22:42:40,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-08 22:42:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:40,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:40,279 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 24 treesize of output 22 [2025-01-08 22:42:40,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 36 [2025-01-08 22:42:40,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-01-08 22:42:40,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2025-01-08 22:42:40,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-01-08 22:42:40,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-01-08 22:42:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666686943] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:42:40,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:42:40,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 40 [2025-01-08 22:42:40,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449786873] [2025-01-08 22:42:40,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:42:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-08 22:42:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-08 22:42:40,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1236, Unknown=0, NotChecked=0, Total=1560 [2025-01-08 22:42:40,496 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:40,711 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2025-01-08 22:42:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-08 22:42:40,712 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-08 22:42:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:40,712 INFO L225 Difference]: With dead ends: 32 [2025-01-08 22:42:40,713 INFO L226 Difference]: Without dead ends: 29 [2025-01-08 22:42:40,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=1448, Unknown=0, NotChecked=0, Total=1806 [2025-01-08 22:42:40,714 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:40,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 47 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:42:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-08 22:42:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-01-08 22:42:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-01-08 22:42:40,719 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2025-01-08 22:42:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:40,719 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-01-08 22:42:40,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-01-08 22:42:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:42:40,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:40,720 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:40,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:42:40,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:40,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash 972379356, now seen corresponding path program 2 times [2025-01-08 22:42:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:40,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300512724] [2025-01-08 22:42:40,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:42:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:40,932 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:42:40,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:42:40,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:42:40,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:42:41,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:41,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300512724] [2025-01-08 22:42:41,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300512724] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:41,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778092023] [2025-01-08 22:42:41,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:42:41,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:41,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:41,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:41,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:42:41,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:42:41,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:42:41,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:42:41,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:41,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:42:41,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:42:41,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:42:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778092023] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:42:41,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:42:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:42:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727484203] [2025-01-08 22:42:41,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:42:41,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:42:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:41,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:42:41,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:42:41,200 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:41,344 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2025-01-08 22:42:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:42:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-08 22:42:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:41,346 INFO L225 Difference]: With dead ends: 58 [2025-01-08 22:42:41,347 INFO L226 Difference]: Without dead ends: 42 [2025-01-08 22:42:41,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:42:41,347 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:41,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:42:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-08 22:42:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2025-01-08 22:42:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2025-01-08 22:42:41,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2025-01-08 22:42:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:41,354 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-01-08 22:42:41,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2025-01-08 22:42:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-08 22:42:41,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:41,355 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:41,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:42:41,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:41,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:41,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2106416868, now seen corresponding path program 3 times [2025-01-08 22:42:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246777519] [2025-01-08 22:42:41,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:42:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:41,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:42:41,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:42:41,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:42:41,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:42:41,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:41,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246777519] [2025-01-08 22:42:41,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246777519] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:41,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248023040] [2025-01-08 22:42:41,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:42:41,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:41,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:41,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:41,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:42:41,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-01-08 22:42:41,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-08 22:42:41,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:42:41,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:41,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:42:41,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:42:41,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:42:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248023040] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:42:41,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:42:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:42:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336484054] [2025-01-08 22:42:41,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:42:41,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:42:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:41,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:42:41,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:42:41,792 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:41,883 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2025-01-08 22:42:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:42:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-08 22:42:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:41,883 INFO L225 Difference]: With dead ends: 52 [2025-01-08 22:42:41,884 INFO L226 Difference]: Without dead ends: 26 [2025-01-08 22:42:41,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:42:41,885 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:41,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:42:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-08 22:42:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-08 22:42:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-01-08 22:42:41,891 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2025-01-08 22:42:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:41,891 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-01-08 22:42:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-01-08 22:42:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:42:41,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:41,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:41,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:42:42,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:42,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:42,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1523075942, now seen corresponding path program 4 times [2025-01-08 22:42:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:42,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981450889] [2025-01-08 22:42:42,099 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:42:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:42,111 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:42:42,154 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:42:42,155 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:42:42,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981450889] [2025-01-08 22:42:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981450889] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:43,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963708369] [2025-01-08 22:42:43,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:42:43,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:43,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:43,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:43,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:42:43,214 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-08 22:42:43,251 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:42:43,251 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:42:43,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:43,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-08 22:42:43,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:43,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:42:43,284 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 16 treesize of output 12 [2025-01-08 22:42:43,321 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 28 treesize of output 27 [2025-01-08 22:42:43,462 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 34 treesize of output 22 [2025-01-08 22:42:43,556 INFO L349 Elim1Store]: treesize reduction 8, result has 79.5 percent of original size [2025-01-08 22:42:43,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 61 [2025-01-08 22:42:43,569 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 63 treesize of output 36 [2025-01-08 22:42:43,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:42:43,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:42:43,864 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 36 treesize of output 13 [2025-01-08 22:42:43,917 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 36 treesize of output 13 [2025-01-08 22:42:43,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:42:44,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:42:44,152 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 40 treesize of output 17 [2025-01-08 22:42:44,200 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 46 treesize of output 23 [2025-01-08 22:42:44,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:44,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 17 [2025-01-08 22:42:44,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-08 22:42:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:44,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:44,434 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 54 treesize of output 50 [2025-01-08 22:42:44,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:44,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 411 treesize of output 387 [2025-01-08 22:42:44,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2025-01-08 22:42:44,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:44,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 338 [2025-01-08 22:42:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:44,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963708369] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:42:44,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:42:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 56 [2025-01-08 22:42:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511966316] [2025-01-08 22:42:44,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:42:44,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-08 22:42:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:44,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-08 22:42:44,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2759, Unknown=0, NotChecked=0, Total=3080 [2025-01-08 22:42:44,912 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 56 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:46,065 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2025-01-08 22:42:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-08 22:42:46,066 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 22:42:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:46,066 INFO L225 Difference]: With dead ends: 63 [2025-01-08 22:42:46,066 INFO L226 Difference]: Without dead ends: 60 [2025-01-08 22:42:46,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=575, Invalid=5431, Unknown=0, NotChecked=0, Total=6006 [2025-01-08 22:42:46,070 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:46,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 88 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:42:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-08 22:42:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2025-01-08 22:42:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2025-01-08 22:42:46,083 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 25 [2025-01-08 22:42:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:46,087 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2025-01-08 22:42:46,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2025-01-08 22:42:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:42:46,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:46,087 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:46,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:42:46,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-08 22:42:46,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:46,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:46,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1467577182, now seen corresponding path program 5 times [2025-01-08 22:42:46,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:46,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038055093] [2025-01-08 22:42:46,292 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:42:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:46,304 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-01-08 22:42:46,315 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:42:46,315 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-08 22:42:46,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:42:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038055093] [2025-01-08 22:42:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038055093] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809628022] [2025-01-08 22:42:46,375 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:42:46,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:46,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:46,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:42:46,429 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-01-08 22:42:46,485 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:42:46,485 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-08 22:42:46,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:46,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:42:46,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:42:46,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:42:46,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809628022] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:42:46,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:42:46,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-01-08 22:42:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338967538] [2025-01-08 22:42:46,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:42:46,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-08 22:42:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:46,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-08 22:42:46,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:42:46,665 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:46,887 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2025-01-08 22:42:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:42:46,891 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-08 22:42:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:46,892 INFO L225 Difference]: With dead ends: 78 [2025-01-08 22:42:46,892 INFO L226 Difference]: Without dead ends: 32 [2025-01-08 22:42:46,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2025-01-08 22:42:46,892 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:46,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 38 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:42:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-08 22:42:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-08 22:42:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-01-08 22:42:46,901 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 26 [2025-01-08 22:42:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:46,901 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-01-08 22:42:46,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-01-08 22:42:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-08 22:42:46,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:46,901 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:46,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:42:47,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:47,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:47,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash -277434412, now seen corresponding path program 6 times [2025-01-08 22:42:47,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:47,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040355562] [2025-01-08 22:42:47,103 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:42:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:47,120 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 3 equivalence classes. [2025-01-08 22:42:47,186 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:42:47,187 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-08 22:42:47,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:49,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:49,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040355562] [2025-01-08 22:42:49,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040355562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:49,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892810348] [2025-01-08 22:42:49,117 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:42:49,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:49,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:49,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:49,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:42:49,170 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 3 equivalence classes. [2025-01-08 22:42:49,212 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-01-08 22:42:49,213 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-08 22:42:49,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:49,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-01-08 22:42:49,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:49,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:42:49,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:42:49,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:42:49,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:49,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-08 22:42:49,440 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 25 treesize of output 13 [2025-01-08 22:42:49,507 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 25 treesize of output 13 [2025-01-08 22:42:49,553 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 25 treesize of output 13 [2025-01-08 22:42:49,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:42:49,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:42:49,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:49,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-08 22:42:49,786 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 36 treesize of output 13 [2025-01-08 22:42:49,841 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 36 treesize of output 13 [2025-01-08 22:42:49,907 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 36 treesize of output 13 [2025-01-08 22:42:49,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:42:49,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:42:50,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-08 22:42:50,170 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 40 treesize of output 17 [2025-01-08 22:42:50,219 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 46 treesize of output 23 [2025-01-08 22:42:50,268 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 51 treesize of output 28 [2025-01-08 22:42:50,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:50,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 21 [2025-01-08 22:42:50,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-08 22:42:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:50,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:50,670 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 100 treesize of output 94 [2025-01-08 22:42:50,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:50,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1991030 treesize of output 1909110 [2025-01-08 22:42:51,232 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 96 treesize of output 90 [2025-01-08 22:42:51,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:51,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9963 treesize of output 9323 [2025-01-08 22:42:51,676 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 96 treesize of output 90 [2025-01-08 22:42:51,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:51,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9843 treesize of output 9203 [2025-01-08 22:42:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892810348] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:42:51,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:42:51,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 76 [2025-01-08 22:42:51,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027660151] [2025-01-08 22:42:51,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:42:51,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-01-08 22:42:51,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:51,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-01-08 22:42:51,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=5299, Unknown=0, NotChecked=0, Total=5700 [2025-01-08 22:42:51,760 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 76 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:53,434 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2025-01-08 22:42:53,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-08 22:42:53,434 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-08 22:42:53,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:53,435 INFO L225 Difference]: With dead ends: 72 [2025-01-08 22:42:53,435 INFO L226 Difference]: Without dead ends: 69 [2025-01-08 22:42:53,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=931, Invalid=10625, Unknown=0, NotChecked=0, Total=11556 [2025-01-08 22:42:53,438 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:53,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 136 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:42:53,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-08 22:42:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2025-01-08 22:42:53,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-01-08 22:42:53,446 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 31 [2025-01-08 22:42:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:53,446 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-01-08 22:42:53,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:53,446 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2025-01-08 22:42:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:42:53,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:53,447 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:53,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 22:42:53,651 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,SelfDestructingSolverStorable7 [2025-01-08 22:42:53,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:53,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -930192996, now seen corresponding path program 7 times [2025-01-08 22:42:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684016211] [2025-01-08 22:42:53,652 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:42:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:53,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:42:53,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:42:53,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:42:53,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 22:42:53,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684016211] [2025-01-08 22:42:53,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684016211] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610865155] [2025-01-08 22:42:53,753 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:42:53,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:53,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:53,755 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:53,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:42:53,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:42:53,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:42:53,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:42:53,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:53,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:42:53,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 22:42:53,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 22:42:53,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610865155] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:42:53,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:42:53,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-01-08 22:42:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056713147] [2025-01-08 22:42:53,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:42:53,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-08 22:42:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:53,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-08 22:42:53,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:42:53,924 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:54,062 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2025-01-08 22:42:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:42:54,062 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-08 22:42:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:54,063 INFO L225 Difference]: With dead ends: 100 [2025-01-08 22:42:54,064 INFO L226 Difference]: Without dead ends: 50 [2025-01-08 22:42:54,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:42:54,065 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:54,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:42:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-08 22:42:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2025-01-08 22:42:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-01-08 22:42:54,074 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 32 [2025-01-08 22:42:54,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:54,075 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-01-08 22:42:54,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-01-08 22:42:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:42:54,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:54,076 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:54,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 22:42:54,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:54,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:54,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash 436605782, now seen corresponding path program 8 times [2025-01-08 22:42:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784812544] [2025-01-08 22:42:54,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:42:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:54,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-08 22:42:54,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:42:54,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:42:54,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-08 22:42:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784812544] [2025-01-08 22:42:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784812544] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025388409] [2025-01-08 22:42:54,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:42:54,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:54,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:54,386 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:54,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:42:54,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-08 22:42:54,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:42:54,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:42:54,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:54,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-08 22:42:54,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-08 22:42:54,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-08 22:42:54,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025388409] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:42:54,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:42:54,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-01-08 22:42:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90768161] [2025-01-08 22:42:54,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:42:54,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:42:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:42:54,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:42:54,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:42:54,582 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:42:54,727 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-01-08 22:42:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:42:54,728 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-08 22:42:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:42:54,728 INFO L225 Difference]: With dead ends: 53 [2025-01-08 22:42:54,728 INFO L226 Difference]: Without dead ends: 38 [2025-01-08 22:42:54,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-01-08 22:42:54,729 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:42:54,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:42:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-08 22:42:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-08 22:42:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-01-08 22:42:54,736 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 33 [2025-01-08 22:42:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:42:54,737 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-01-08 22:42:54,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:42:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-01-08 22:42:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 22:42:54,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:42:54,737 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:42:54,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 22:42:54,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:54,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:42:54,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:42:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash -508794790, now seen corresponding path program 9 times [2025-01-08 22:42:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:42:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069660779] [2025-01-08 22:42:54,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:42:54,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:42:54,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-01-08 22:42:55,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:42:55,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:42:55,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:57,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:42:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069660779] [2025-01-08 22:42:57,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069660779] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:42:57,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517896943] [2025-01-08 22:42:57,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:42:57,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:42:57,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:42:57,586 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:42:57,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:42:57,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-01-08 22:42:57,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:42:57,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:42:57,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:42:57,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-01-08 22:42:57,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:42:57,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:42:57,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:42:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:42:57,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:57,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-08 22:42:57,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:57,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-01-08 22:42:58,057 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 25 treesize of output 13 [2025-01-08 22:42:58,118 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 25 treesize of output 13 [2025-01-08 22:42:58,179 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 25 treesize of output 13 [2025-01-08 22:42:58,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:58,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 52 treesize of output 62 [2025-01-08 22:42:58,249 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 95 treesize of output 60 [2025-01-08 22:42:58,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:42:58,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:42:58,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:58,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-08 22:42:58,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:58,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-01-08 22:42:58,575 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 36 treesize of output 13 [2025-01-08 22:42:58,629 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 36 treesize of output 13 [2025-01-08 22:42:58,690 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 36 treesize of output 13 [2025-01-08 22:42:58,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:58,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 58 [2025-01-08 22:42:58,761 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 36 treesize of output 13 [2025-01-08 22:42:58,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:42:58,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:42:58,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-08 22:42:59,009 INFO L349 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2025-01-08 22:42:59,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2025-01-08 22:42:59,182 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 40 treesize of output 17 [2025-01-08 22:42:59,246 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 46 treesize of output 23 [2025-01-08 22:42:59,311 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 51 treesize of output 28 [2025-01-08 22:42:59,369 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 56 treesize of output 33 [2025-01-08 22:42:59,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:59,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 25 [2025-01-08 22:42:59,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-08 22:42:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:42:59,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:42:59,850 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 96 treesize of output 90 [2025-01-08 22:42:59,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:42:59,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210758 treesize of output 200518 [2025-01-08 22:43:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517896943] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:00,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 91 [2025-01-08 22:43:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742329183] [2025-01-08 22:43:00,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-01-08 22:43:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:00,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-01-08 22:43:00,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1087, Invalid=7103, Unknown=0, NotChecked=0, Total=8190 [2025-01-08 22:43:00,993 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 91 states, 91 states have (on average 1.0879120879120878) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:07,949 INFO L93 Difference]: Finished difference Result 144 states and 178 transitions. [2025-01-08 22:43:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-01-08 22:43:07,950 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.0879120879120878) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-08 22:43:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:07,951 INFO L225 Difference]: With dead ends: 144 [2025-01-08 22:43:07,951 INFO L226 Difference]: Without dead ends: 141 [2025-01-08 22:43:07,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8895 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3630, Invalid=23430, Unknown=0, NotChecked=0, Total=27060 [2025-01-08 22:43:07,956 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:07,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-08 22:43:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-08 22:43:07,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 82. [2025-01-08 22:43:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2025-01-08 22:43:07,984 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 37 [2025-01-08 22:43:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:07,984 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-01-08 22:43:07,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 1.0879120879120878) internal successors, (99), 91 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2025-01-08 22:43:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 22:43:07,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:07,985 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:07,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-08 22:43:08,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:08,187 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:08,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1067753822, now seen corresponding path program 10 times [2025-01-08 22:43:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:08,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785966615] [2025-01-08 22:43:08,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:43:08,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:08,204 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:43:08,212 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 38 statements. [2025-01-08 22:43:08,213 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:43:08,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:43:08,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:08,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785966615] [2025-01-08 22:43:08,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785966615] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:08,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962454660] [2025-01-08 22:43:08,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:43:08,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:08,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:08,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:43:08,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:43:08,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:43:08,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 38 statements. [2025-01-08 22:43:08,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:43:08,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:08,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:43:08,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:43:08,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:43:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962454660] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:08,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:08,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-01-08 22:43:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101475188] [2025-01-08 22:43:08,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:08,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-08 22:43:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:08,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-08 22:43:08,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:43:08,554 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:08,926 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2025-01-08 22:43:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:43:08,926 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-08 22:43:08,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:08,927 INFO L225 Difference]: With dead ends: 142 [2025-01-08 22:43:08,927 INFO L226 Difference]: Without dead ends: 91 [2025-01-08 22:43:08,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:43:08,928 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:08,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:43:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-08 22:43:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2025-01-08 22:43:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 75 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2025-01-08 22:43:08,969 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 38 [2025-01-08 22:43:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:08,969 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2025-01-08 22:43:08,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2025-01-08 22:43:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:43:08,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:08,969 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:08,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 22:43:09,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 22:43:09,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:09,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:09,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1915391208, now seen corresponding path program 11 times [2025-01-08 22:43:09,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89208908] [2025-01-08 22:43:09,170 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:43:09,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:09,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 4 equivalence classes. [2025-01-08 22:43:09,230 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:43:09,231 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-08 22:43:09,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 22:43:09,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89208908] [2025-01-08 22:43:09,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89208908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:09,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736305526] [2025-01-08 22:43:09,389 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:43:09,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:09,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:09,390 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:43:09,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:43:09,463 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 4 equivalence classes. [2025-01-08 22:43:09,725 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:43:09,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-08 22:43:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:09,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 22:43:09,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-08 22:43:09,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:09,991 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-08 22:43:09,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736305526] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:43:09,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:43:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 33 [2025-01-08 22:43:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198461540] [2025-01-08 22:43:09,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:43:09,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-08 22:43:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:43:09,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-08 22:43:09,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2025-01-08 22:43:09,993 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:43:10,446 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2025-01-08 22:43:10,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 22:43:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-08 22:43:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:43:10,447 INFO L225 Difference]: With dead ends: 153 [2025-01-08 22:43:10,447 INFO L226 Difference]: Without dead ends: 83 [2025-01-08 22:43:10,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=2059, Unknown=0, NotChecked=0, Total=2450 [2025-01-08 22:43:10,447 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:43:10,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 69 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:43:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-08 22:43:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2025-01-08 22:43:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-01-08 22:43:10,464 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 41 [2025-01-08 22:43:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:43:10,464 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-01-08 22:43:10,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:43:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-01-08 22:43:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:43:10,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:43:10,465 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:43:10,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-08 22:43:10,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-08 22:43:10,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:43:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:43:10,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1974824940, now seen corresponding path program 12 times [2025-01-08 22:43:10,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:43:10,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921422611] [2025-01-08 22:43:10,666 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:43:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:43:10,680 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 4 equivalence classes. [2025-01-08 22:43:10,750 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:43:10,750 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-08 22:43:10,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:14,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:43:14,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921422611] [2025-01-08 22:43:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921422611] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:43:14,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312797561] [2025-01-08 22:43:14,196 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:43:14,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:43:14,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:43:14,198 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:43:14,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:43:14,274 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 43 statements into 4 equivalence classes. [2025-01-08 22:43:14,394 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:43:14,394 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-08 22:43:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:43:14,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-01-08 22:43:14,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:43:14,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:43:14,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:43:14,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:43:14,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:14,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-08 22:43:14,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:14,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-01-08 22:43:14,675 INFO L349 Elim1Store]: treesize reduction 64, result has 31.2 percent of original size [2025-01-08 22:43:14,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 50 [2025-01-08 22:43:14,831 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 25 treesize of output 13 [2025-01-08 22:43:14,911 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 25 treesize of output 13 [2025-01-08 22:43:14,987 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 25 treesize of output 13 [2025-01-08 22:43:15,069 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 25 treesize of output 13 [2025-01-08 22:43:15,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:15,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:15,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:15,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:15,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:15,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:15,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:15,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:43:15,163 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:43:15,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:15,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 36 [2025-01-08 22:43:15,169 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 25 treesize of output 13 [2025-01-08 22:43:15,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:43:15,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:43:15,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:15,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-08 22:43:15,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:15,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-01-08 22:43:15,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:15,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-01-08 22:43:15,734 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 36 treesize of output 13 [2025-01-08 22:43:15,825 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 36 treesize of output 13 [2025-01-08 22:43:15,914 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 36 treesize of output 13 [2025-01-08 22:43:15,996 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 36 treesize of output 13 [2025-01-08 22:43:16,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:16,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 69 [2025-01-08 22:43:16,112 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 36 treesize of output 13 [2025-01-08 22:43:16,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-08 22:43:16,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-08 22:43:16,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-01-08 22:43:16,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-01-08 22:43:16,512 INFO L349 Elim1Store]: treesize reduction 72, result has 38.5 percent of original size [2025-01-08 22:43:16,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 57 [2025-01-08 22:43:16,725 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 40 treesize of output 17 [2025-01-08 22:43:16,797 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 46 treesize of output 23 [2025-01-08 22:43:16,869 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 51 treesize of output 28 [2025-01-08 22:43:16,948 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 56 treesize of output 33 [2025-01-08 22:43:17,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:17,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 81 [2025-01-08 22:43:17,047 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 41 treesize of output 18 [2025-01-08 22:43:17,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-08 22:43:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 1 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:43:17,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:43:18,018 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 195 treesize of output 187 [2025-01-08 22:43:19,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:19,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 269915673985046 treesize of output 266446229602326 [2025-01-08 22:43:42,458 WARN L286 SmtUtils]: Spent 23.06s on a formula simplification. DAG size of input: 40672 DAG size of output: 243 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-08 22:43:49,710 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 236 treesize of output 226 [2025-01-08 22:43:49,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:43:49,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 841179158 treesize of output 820207670