./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i --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/uthash-2.0.2/uthash_SFH_test8-1.i -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 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:59:45,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:59:45,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:59:45,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:59:45,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:59:45,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:59:45,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:59:45,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:59:45,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:59:45,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:59:45,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:59:45,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:59:45,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:59:45,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:59:45,726 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:59:45,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:59:45,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:59:45,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:59:45,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:59:45,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:45,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:45,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:59:45,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:59:45,732 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:59:45,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:59:45,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:59:45,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:59:45,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:59:45,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:59:45,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:59:45,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:59:45,732 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 -> 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 [2025-01-09 20:59:45,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:59:45,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:59:45,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:59:45,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:59:45,952 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:59:45,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2025-01-09 20:59:47,044 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/427bc3ce2/0e78bec0bf0d4befa61c72706bbed805/FLAG69419d3a5 [2025-01-09 20:59:47,376 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:59:47,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2025-01-09 20:59:47,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/427bc3ce2/0e78bec0bf0d4befa61c72706bbed805/FLAG69419d3a5 [2025-01-09 20:59:47,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/427bc3ce2/0e78bec0bf0d4befa61c72706bbed805 [2025-01-09 20:59:47,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:59:47,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:59:47,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:59:47,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:59:47,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:59:47,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:59:47" (1/1) ... [2025-01-09 20:59:47,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad2ef7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:47, skipping insertion in model container [2025-01-09 20:59:47,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:59:47" (1/1) ... [2025-01-09 20:59:47,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:59:47,851 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/uthash-2.0.2/uthash_SFH_test8-1.i[33021,33034] [2025-01-09 20:59:47,933 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/uthash-2.0.2/uthash_SFH_test8-1.i[45234,45247] [2025-01-09 20:59:47,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:59:47,944 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:59:47,976 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/uthash-2.0.2/uthash_SFH_test8-1.i[33021,33034] [2025-01-09 20:59:48,022 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/uthash-2.0.2/uthash_SFH_test8-1.i[45234,45247] [2025-01-09 20:59:48,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:59:48,054 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:59:48,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48 WrapperNode [2025-01-09 20:59:48,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:59:48,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:59:48,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:59:48,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:59:48,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,133 INFO L138 Inliner]: procedures = 177, calls = 289, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1381 [2025-01-09 20:59:48,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:59:48,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:59:48,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:59:48,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:59:48,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,210 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-01-09 20:59:48,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,233 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:59:48,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:59:48,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:59:48,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:59:48,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (1/1) ... [2025-01-09 20:59:48,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:48,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:48,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:59:48,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:59:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:59:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:59:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:59:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:59:48,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:59:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:59:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:59:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:59:48,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:59:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:59:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:59:48,308 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:59:48,308 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:59:48,308 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:59:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-01-09 20:59:48,308 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-01-09 20:59:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:59:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:59:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:59:48,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:59:48,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:59:48,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:59:48,484 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:59:48,485 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:59:49,472 INFO L? ?]: Removed 328 outVars from TransFormulas that were not future-live. [2025-01-09 20:59:49,472 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:59:49,482 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:59:49,482 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-09 20:59:49,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:59:49 BoogieIcfgContainer [2025-01-09 20:59:49,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:59:49,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:59:49,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:59:49,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:59:49,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:59:47" (1/3) ... [2025-01-09 20:59:49,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7907f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:59:49, skipping insertion in model container [2025-01-09 20:59:49,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:48" (2/3) ... [2025-01-09 20:59:49,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7907f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:59:49, skipping insertion in model container [2025-01-09 20:59:49,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:59:49" (3/3) ... [2025-01-09 20:59:49,488 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-1.i [2025-01-09 20:59:49,496 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:59:49,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test8-1.i that has 6 procedures, 442 locations, 1 initial locations, 37 loop locations, and 2 error locations. [2025-01-09 20:59:49,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:59:49,538 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;@60186aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:59:49,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:59:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 408 states have (on average 1.6200980392156863) internal successors, (661), 425 states have internal predecessors, (661), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:59:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:59:49,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:49,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:49,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:49,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -978364192, now seen corresponding path program 1 times [2025-01-09 20:59:49,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:49,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779933286] [2025-01-09 20:59:49,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:49,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:59:49,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:59:49,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:49,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779933286] [2025-01-09 20:59:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779933286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:49,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:49,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:59:49,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827032432] [2025-01-09 20:59:49,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:49,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:59:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:49,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:59:49,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:59:49,674 INFO L87 Difference]: Start difference. First operand has 434 states, 408 states have (on average 1.6200980392156863) internal successors, (661), 425 states have internal predecessors, (661), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-09 20:59:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:49,723 INFO L93 Difference]: Finished difference Result 866 states and 1417 transitions. [2025-01-09 20:59:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:59:49,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-01-09 20:59:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:49,731 INFO L225 Difference]: With dead ends: 866 [2025-01-09 20:59:49,731 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 20:59:49,733 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-09 20:59:49,735 INFO L435 NwaCegarLoop]: 637 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, 637 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-09 20:59:49,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 20:59:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-01-09 20:59:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 405 states have (on average 1.4641975308641975) internal successors, (593), 421 states have internal predecessors, (593), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:59:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 633 transitions. [2025-01-09 20:59:49,791 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 633 transitions. Word has length 9 [2025-01-09 20:59:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:49,792 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 633 transitions. [2025-01-09 20:59:49,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-09 20:59:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 633 transitions. [2025-01-09 20:59:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 20:59:49,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:49,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:49,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:59:49,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:49,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash -739758881, now seen corresponding path program 1 times [2025-01-09 20:59:49,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:49,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097151675] [2025-01-09 20:59:49,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:49,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:49,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 20:59:49,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 20:59:49,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:49,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:50,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097151675] [2025-01-09 20:59:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097151675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:59:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982065042] [2025-01-09 20:59:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:50,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:50,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:50,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:50,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:59:50,189 INFO L87 Difference]: Start difference. First operand 430 states and 633 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-09 20:59:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:50,331 INFO L93 Difference]: Finished difference Result 1040 states and 1532 transitions. [2025-01-09 20:59:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:59:50,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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 63 [2025-01-09 20:59:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:50,338 INFO L225 Difference]: With dead ends: 1040 [2025-01-09 20:59:50,338 INFO L226 Difference]: Without dead ends: 813 [2025-01-09 20:59:50,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:50,340 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 545 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:50,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1834 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-01-09 20:59:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 432. [2025-01-09 20:59:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 407 states have (on average 1.461916461916462) internal successors, (595), 423 states have internal predecessors, (595), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:59:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 635 transitions. [2025-01-09 20:59:50,357 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 635 transitions. Word has length 63 [2025-01-09 20:59:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 635 transitions. [2025-01-09 20:59:50,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-09 20:59:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 635 transitions. [2025-01-09 20:59:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 20:59:50,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:50,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:50,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:59:50,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:50,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:50,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1960433844, now seen corresponding path program 1 times [2025-01-09 20:59:50,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:50,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31031946] [2025-01-09 20:59:50,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:50,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:50,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 20:59:50,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 20:59:50,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:50,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31031946] [2025-01-09 20:59:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31031946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:50,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:50,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:59:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751461307] [2025-01-09 20:59:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:50,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:59:50,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:50,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:59:50,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:50,647 INFO L87 Difference]: Start difference. First operand 432 states and 635 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:59:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:50,738 INFO L93 Difference]: Finished difference Result 818 states and 1200 transitions. [2025-01-09 20:59:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:59:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 20:59:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:50,743 INFO L225 Difference]: With dead ends: 818 [2025-01-09 20:59:50,743 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 20:59:50,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:50,745 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 14 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:50,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2093 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 20:59:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-01-09 20:59:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 365 states have (on average 1.4191780821917808) internal successors, (518), 381 states have internal predecessors, (518), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:59:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 558 transitions. [2025-01-09 20:59:50,764 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 558 transitions. Word has length 85 [2025-01-09 20:59:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:50,764 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 558 transitions. [2025-01-09 20:59:50,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:59:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 558 transitions. [2025-01-09 20:59:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 20:59:50,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:50,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:50,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:59:50,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:50,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1848100066, now seen corresponding path program 1 times [2025-01-09 20:59:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691106766] [2025-01-09 20:59:50,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:50,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 20:59:50,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 20:59:50,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:50,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:50,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691106766] [2025-01-09 20:59:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691106766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:59:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459426484] [2025-01-09 20:59:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:50,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:50,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:50,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:59:50,914 INFO L87 Difference]: Start difference. First operand 390 states and 558 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:59:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:50,975 INFO L93 Difference]: Finished difference Result 770 states and 1106 transitions. [2025-01-09 20:59:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:59:50,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 20:59:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:50,977 INFO L225 Difference]: With dead ends: 770 [2025-01-09 20:59:50,978 INFO L226 Difference]: Without dead ends: 384 [2025-01-09 20:59:50,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:50,979 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 9 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:50,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1574 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-01-09 20:59:50,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-01-09 20:59:50,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 359 states have (on average 1.415041782729805) internal successors, (508), 375 states have internal predecessors, (508), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:59:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 548 transitions. [2025-01-09 20:59:50,994 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 548 transitions. Word has length 85 [2025-01-09 20:59:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:50,994 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 548 transitions. [2025-01-09 20:59:50,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:59:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 548 transitions. [2025-01-09 20:59:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 20:59:50,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:50,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:50,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:59:50,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:50,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash 295853290, now seen corresponding path program 1 times [2025-01-09 20:59:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:50,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869355497] [2025-01-09 20:59:50,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:51,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 20:59:51,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 20:59:51,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:51,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869355497] [2025-01-09 20:59:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869355497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:51,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:59:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986724435] [2025-01-09 20:59:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:51,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:59:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:51,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:59:51,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:51,144 INFO L87 Difference]: Start difference. First operand 384 states and 548 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:59:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:51,244 INFO L93 Difference]: Finished difference Result 1009 states and 1443 transitions. [2025-01-09 20:59:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:59:51,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 20:59:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:51,249 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 20:59:51,249 INFO L226 Difference]: Without dead ends: 629 [2025-01-09 20:59:51,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:51,253 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 290 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:51,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1253 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-01-09 20:59:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2025-01-09 20:59:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 600 states have (on average 1.4216666666666666) internal successors, (853), 616 states have internal predecessors, (853), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:59:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 895 transitions. [2025-01-09 20:59:51,273 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 895 transitions. Word has length 85 [2025-01-09 20:59:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:51,275 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 895 transitions. [2025-01-09 20:59:51,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:59:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 895 transitions. [2025-01-09 20:59:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 20:59:51,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:51,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:51,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:59:51,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:51,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1272917515, now seen corresponding path program 1 times [2025-01-09 20:59:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000453170] [2025-01-09 20:59:51,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:51,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 20:59:51,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 20:59:51,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:51,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:59:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000453170] [2025-01-09 20:59:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000453170] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061296007] [2025-01-09 20:59:51,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:51,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:51,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:51,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:51,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 20:59:51,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 20:59:51,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 20:59:51,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:51,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:51,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 20:59:51,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:59:51,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:59:51,995 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 17 [2025-01-09 20:59:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:59:52,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:59:52,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061296007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:52,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:59:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 20:59:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912525480] [2025-01-09 20:59:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:52,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:59:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:52,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:59:52,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:59:52,659 INFO L87 Difference]: Start difference. First operand 626 states and 895 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:53,938 INFO L93 Difference]: Finished difference Result 1497 states and 2151 transitions. [2025-01-09 20:59:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:59:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 20:59:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:53,942 INFO L225 Difference]: With dead ends: 1497 [2025-01-09 20:59:53,942 INFO L226 Difference]: Without dead ends: 909 [2025-01-09 20:59:53,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 20:59:53,944 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 554 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 3408 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:53,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 3408 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 20:59:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-01-09 20:59:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 626. [2025-01-09 20:59:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 600 states have (on average 1.42) internal successors, (852), 616 states have internal predecessors, (852), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:59:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 894 transitions. [2025-01-09 20:59:53,959 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 894 transitions. Word has length 100 [2025-01-09 20:59:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:53,960 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 894 transitions. [2025-01-09 20:59:53,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 894 transitions. [2025-01-09 20:59:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 20:59:53,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:53,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:53,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 20:59:54,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:54,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:54,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1382328633, now seen corresponding path program 1 times [2025-01-09 20:59:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362127879] [2025-01-09 20:59:54,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:54,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 20:59:54,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 20:59:54,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:54,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:59:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362127879] [2025-01-09 20:59:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362127879] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802251554] [2025-01-09 20:59:54,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:54,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:54,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:54,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:54,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 20:59:54,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 20:59:54,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 20:59:54,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:54,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:54,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 20:59:54,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:59:54,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:59:54,833 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 17 [2025-01-09 20:59:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:59:55,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:59:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802251554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:59:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-09 20:59:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613439425] [2025-01-09 20:59:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:55,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 20:59:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:55,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 20:59:55,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-01-09 20:59:55,421 INFO L87 Difference]: Start difference. First operand 626 states and 894 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:56,495 INFO L93 Difference]: Finished difference Result 1497 states and 2150 transitions. [2025-01-09 20:59:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 20:59:56,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-01-09 20:59:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:56,501 INFO L225 Difference]: With dead ends: 1497 [2025-01-09 20:59:56,502 INFO L226 Difference]: Without dead ends: 914 [2025-01-09 20:59:56,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-01-09 20:59:56,504 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 601 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:56,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 3674 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 20:59:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-01-09 20:59:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 630. [2025-01-09 20:59:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 604 states have (on average 1.4188741721854305) internal successors, (857), 620 states have internal predecessors, (857), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:59:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 899 transitions. [2025-01-09 20:59:56,524 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 899 transitions. Word has length 101 [2025-01-09 20:59:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:56,524 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 899 transitions. [2025-01-09 20:59:56,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 899 transitions. [2025-01-09 20:59:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 20:59:56,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:56,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:56,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 20:59:56,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:56,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1315713353, now seen corresponding path program 1 times [2025-01-09 20:59:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506018515] [2025-01-09 20:59:56,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:56,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 20:59:56,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 20:59:56,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:56,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:59:56,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506018515] [2025-01-09 20:59:56,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506018515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:56,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:56,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522563886] [2025-01-09 20:59:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:56,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:56,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:56,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:56,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:56,994 INFO L87 Difference]: Start difference. First operand 630 states and 899 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:57,223 INFO L93 Difference]: Finished difference Result 1218 states and 1753 transitions. [2025-01-09 20:59:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:57,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-09 20:59:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:57,226 INFO L225 Difference]: With dead ends: 1218 [2025-01-09 20:59:57,226 INFO L226 Difference]: Without dead ends: 640 [2025-01-09 20:59:57,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:57,227 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 10 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:57,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2835 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-01-09 20:59:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 638. [2025-01-09 20:59:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 612 states have (on average 1.4166666666666667) internal successors, (867), 628 states have internal predecessors, (867), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:59:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 909 transitions. [2025-01-09 20:59:57,240 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 909 transitions. Word has length 102 [2025-01-09 20:59:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:57,241 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 909 transitions. [2025-01-09 20:59:57,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 909 transitions. [2025-01-09 20:59:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 20:59:57,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:57,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:59:57,242 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:57,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:57,242 INFO L85 PathProgramCache]: Analyzing trace with hash -161540912, now seen corresponding path program 1 times [2025-01-09 20:59:57,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:57,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12712649] [2025-01-09 20:59:57,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:57,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 20:59:57,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 20:59:57,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:57,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:59:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12712649] [2025-01-09 20:59:57,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12712649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:59:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234577904] [2025-01-09 20:59:57,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:57,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:59:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:57,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:59:57,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:59:57,476 INFO L87 Difference]: Start difference. First operand 638 states and 909 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:57,657 INFO L93 Difference]: Finished difference Result 1233 states and 1773 transitions. [2025-01-09 20:59:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:59:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-09 20:59:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:57,660 INFO L225 Difference]: With dead ends: 1233 [2025-01-09 20:59:57,660 INFO L226 Difference]: Without dead ends: 644 [2025-01-09 20:59:57,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:59:57,663 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 5 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:57,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1942 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-01-09 20:59:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2025-01-09 20:59:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 618 states have (on average 1.412621359223301) internal successors, (873), 634 states have internal predecessors, (873), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:59:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 915 transitions. [2025-01-09 20:59:57,682 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 915 transitions. Word has length 102 [2025-01-09 20:59:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:57,683 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 915 transitions. [2025-01-09 20:59:57,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 915 transitions. [2025-01-09 20:59:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 20:59:57,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:57,684 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:57,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:59:57,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1022910181, now seen corresponding path program 1 times [2025-01-09 20:59:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:57,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822580776] [2025-01-09 20:59:57,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:57,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:59:57,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:59:57,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:57,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:59:57,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:57,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822580776] [2025-01-09 20:59:57,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822580776] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:57,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468176758] [2025-01-09 20:59:57,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:57,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:57,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:57,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:57,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 20:59:58,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:59:58,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:59:58,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:58,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:58,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 20:59:58,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:59:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:59:58,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:59:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468176758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:59:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 20:59:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223849042] [2025-01-09 20:59:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:58,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:58,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:58,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:58,264 INFO L87 Difference]: Start difference. First operand 644 states and 915 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:58,517 INFO L93 Difference]: Finished difference Result 1249 states and 1791 transitions. [2025-01-09 20:59:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:59:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-01-09 20:59:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:58,520 INFO L225 Difference]: With dead ends: 1249 [2025-01-09 20:59:58,521 INFO L226 Difference]: Without dead ends: 650 [2025-01-09 20:59:58,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:59:58,522 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 33 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:58,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2864 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-01-09 20:59:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 644. [2025-01-09 20:59:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 618 states have (on average 1.4077669902912622) internal successors, (870), 634 states have internal predecessors, (870), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:59:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 912 transitions. [2025-01-09 20:59:58,542 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 912 transitions. Word has length 103 [2025-01-09 20:59:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:58,542 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 912 transitions. [2025-01-09 20:59:58,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:59:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 912 transitions. [2025-01-09 20:59:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 20:59:58,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:58,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:58,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 20:59:58,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:58,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:59:58,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 77705284, now seen corresponding path program 1 times [2025-01-09 20:59:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336621265] [2025-01-09 20:59:58,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:58,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:59:58,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:59:58,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:58,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:59:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:58,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336621265] [2025-01-09 20:59:58,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336621265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:59:58,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728811998] [2025-01-09 20:59:58,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:58,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:59:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:58,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:59:58,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:59:59,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:59:59,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:59:59,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:59,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:59,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 20:59:59,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:08,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:08,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728811998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:08,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:08,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 21:00:08,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810516137] [2025-01-09 21:00:08,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:08,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:00:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:08,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:00:08,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:00:08,725 INFO L87 Difference]: Start difference. First operand 644 states and 912 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:13,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:15,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:19,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:20,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:22,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 21:00:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:23,177 INFO L93 Difference]: Finished difference Result 1241 states and 1775 transitions. [2025-01-09 21:00:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:00:23,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-01-09 21:00:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:23,180 INFO L225 Difference]: With dead ends: 1241 [2025-01-09 21:00:23,180 INFO L226 Difference]: Without dead ends: 654 [2025-01-09 21:00:23,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:00:23,181 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 8 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:23,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2842 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 2 Unknown, 0 Unchecked, 14.4s Time] [2025-01-09 21:00:23,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-01-09 21:00:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 644. [2025-01-09 21:00:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 618 states have (on average 1.4077669902912622) internal successors, (870), 634 states have internal predecessors, (870), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 912 transitions. [2025-01-09 21:00:23,193 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 912 transitions. Word has length 103 [2025-01-09 21:00:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:23,193 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 912 transitions. [2025-01-09 21:00:23,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 912 transitions. [2025-01-09 21:00:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 21:00:23,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:23,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:23,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:00:23,395 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,SelfDestructingSolverStorable10 [2025-01-09 21:00:23,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:23,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:23,396 INFO L85 PathProgramCache]: Analyzing trace with hash 977941492, now seen corresponding path program 1 times [2025-01-09 21:00:23,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:23,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538804786] [2025-01-09 21:00:23,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:23,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:00:23,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:00:23,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:23,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538804786] [2025-01-09 21:00:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538804786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:23,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:23,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:00:23,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481515352] [2025-01-09 21:00:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:23,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:00:23,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:23,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:00:23,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:00:23,683 INFO L87 Difference]: Start difference. First operand 644 states and 912 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:24,142 INFO L93 Difference]: Finished difference Result 1263 states and 1804 transitions. [2025-01-09 21:00:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:00:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-01-09 21:00:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:24,145 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 21:00:24,145 INFO L226 Difference]: Without dead ends: 676 [2025-01-09 21:00:24,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:00:24,146 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 19 mSDsluCounter, 3756 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4288 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:24,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4288 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:00:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-01-09 21:00:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 664. [2025-01-09 21:00:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 638 states have (on average 1.401253918495298) internal successors, (894), 654 states have internal predecessors, (894), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 936 transitions. [2025-01-09 21:00:24,160 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 936 transitions. Word has length 105 [2025-01-09 21:00:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:24,161 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 936 transitions. [2025-01-09 21:00:24,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 936 transitions. [2025-01-09 21:00:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 21:00:24,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:24,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:24,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:00:24,162 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:24,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:24,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2040772904, now seen corresponding path program 1 times [2025-01-09 21:00:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368202471] [2025-01-09 21:00:24,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:24,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:00:24,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:00:24,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:24,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:00:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368202471] [2025-01-09 21:00:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368202471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53862837] [2025-01-09 21:00:24,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:24,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:24,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:24,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:00:24,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:00:24,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:00:24,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:00:24,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:24,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:24,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 21:00:24,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:24,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53862837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:24,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:24,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-09 21:00:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198206784] [2025-01-09 21:00:24,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:24,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:00:24,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:24,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:00:24,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:00:24,977 INFO L87 Difference]: Start difference. First operand 664 states and 936 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:25,612 INFO L93 Difference]: Finished difference Result 1291 states and 1838 transitions. [2025-01-09 21:00:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:00:25,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-01-09 21:00:25,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:25,615 INFO L225 Difference]: With dead ends: 1291 [2025-01-09 21:00:25,615 INFO L226 Difference]: Without dead ends: 694 [2025-01-09 21:00:25,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 21:00:25,616 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 13 mSDsluCounter, 3716 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:25,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4248 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 21:00:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-01-09 21:00:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 688. [2025-01-09 21:00:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 662 states have (on average 1.3957703927492446) internal successors, (924), 678 states have internal predecessors, (924), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 966 transitions. [2025-01-09 21:00:25,631 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 966 transitions. Word has length 105 [2025-01-09 21:00:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:25,632 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 966 transitions. [2025-01-09 21:00:25,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 966 transitions. [2025-01-09 21:00:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 21:00:25,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:25,633 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:25,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 21:00:25,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 21:00:25,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:25,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash -294541153, now seen corresponding path program 1 times [2025-01-09 21:00:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:25,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532971711] [2025-01-09 21:00:25,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:25,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:25,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:00:25,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:00:25,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:25,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:00:25,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:25,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532971711] [2025-01-09 21:00:25,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532971711] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:25,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988979044] [2025-01-09 21:00:25,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:25,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:25,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:25,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:00:25,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:00:26,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:00:26,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:00:26,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:26,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:26,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 21:00:26,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:26,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988979044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:26,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-09 21:00:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103022099] [2025-01-09 21:00:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:26,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:00:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:00:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:00:26,404 INFO L87 Difference]: Start difference. First operand 688 states and 966 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:26,780 INFO L93 Difference]: Finished difference Result 1307 states and 1856 transitions. [2025-01-09 21:00:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:00:26,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-01-09 21:00:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:26,783 INFO L225 Difference]: With dead ends: 1307 [2025-01-09 21:00:26,783 INFO L226 Difference]: Without dead ends: 698 [2025-01-09 21:00:26,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:00:26,784 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 6 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:26,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2842 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:00:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-01-09 21:00:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 688. [2025-01-09 21:00:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 662 states have (on average 1.3957703927492446) internal successors, (924), 678 states have internal predecessors, (924), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 21:00:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 966 transitions. [2025-01-09 21:00:26,796 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 966 transitions. Word has length 105 [2025-01-09 21:00:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:26,797 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 966 transitions. [2025-01-09 21:00:26,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 966 transitions. [2025-01-09 21:00:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 21:00:26,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:26,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:26,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 21:00:27,000 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,SelfDestructingSolverStorable13 [2025-01-09 21:00:27,001 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:27,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1504865631, now seen corresponding path program 1 times [2025-01-09 21:00:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:27,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920888653] [2025-01-09 21:00:27,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:27,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:00:27,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:00:27,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:27,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:00:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:27,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920888653] [2025-01-09 21:00:27,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920888653] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:27,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161471828] [2025-01-09 21:00:27,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:27,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:27,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:27,175 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:00:27,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:00:27,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 21:00:27,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 21:00:27,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:27,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:27,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 21:00:27,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:00:27,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:00:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161471828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:27,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:00:27,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 21:00:27,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941478699] [2025-01-09 21:00:27,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:27,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:00:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:27,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:00:27,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:00:27,712 INFO L87 Difference]: Start difference. First operand 688 states and 966 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:00:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:27,733 INFO L93 Difference]: Finished difference Result 1263 states and 1791 transitions. [2025-01-09 21:00:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:00:27,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2025-01-09 21:00:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:27,736 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 21:00:27,736 INFO L226 Difference]: Without dead ends: 691 [2025-01-09 21:00:27,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:00:27,738 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 0 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:27,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1622 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:00:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-01-09 21:00:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2025-01-09 21:00:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 664 states have (on average 1.3960843373493976) internal successors, (927), 681 states have internal predecessors, (927), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:00:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 970 transitions. [2025-01-09 21:00:27,750 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 970 transitions. Word has length 106 [2025-01-09 21:00:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:27,750 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 970 transitions. [2025-01-09 21:00:27,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:00:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 970 transitions. [2025-01-09 21:00:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 21:00:27,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:27,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:27,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 21:00:27,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:27,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:27,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash 83966335, now seen corresponding path program 1 times [2025-01-09 21:00:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:27,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089340407] [2025-01-09 21:00:27,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:27,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:00:28,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:00:28,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:28,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:00:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:28,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089340407] [2025-01-09 21:00:28,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089340407] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:28,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756148887] [2025-01-09 21:00:28,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:28,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:28,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:28,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:00:28,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 21:00:28,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:00:28,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:00:28,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:28,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:28,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 21:00:28,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:00:28,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:00:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:00:28,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756148887] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:00:28,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:00:28,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:00:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131362016] [2025-01-09 21:00:28,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:00:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:00:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:28,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:00:28,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:00:28,758 INFO L87 Difference]: Start difference. First operand 691 states and 970 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:00:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:28,834 INFO L93 Difference]: Finished difference Result 1277 states and 1813 transitions. [2025-01-09 21:00:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:00:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 108 [2025-01-09 21:00:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:28,837 INFO L225 Difference]: With dead ends: 1277 [2025-01-09 21:00:28,837 INFO L226 Difference]: Without dead ends: 700 [2025-01-09 21:00:28,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:00:28,838 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 5 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:28,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1626 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:00:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-09 21:00:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2025-01-09 21:00:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 672 states have (on average 1.3973214285714286) internal successors, (939), 689 states have internal predecessors, (939), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (23), 7 states have call predecessors, (23), 21 states have call successors, (23) [2025-01-09 21:00:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 983 transitions. [2025-01-09 21:00:28,850 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 983 transitions. Word has length 108 [2025-01-09 21:00:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:28,850 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 983 transitions. [2025-01-09 21:00:28,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:00:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 983 transitions. [2025-01-09 21:00:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 21:00:28,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:28,851 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:28,866 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-09 21:00:29,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 21:00:29,052 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:29,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash 279365601, now seen corresponding path program 2 times [2025-01-09 21:00:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485088386] [2025-01-09 21:00:29,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:00:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:29,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-01-09 21:00:29,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 112 statements. [2025-01-09 21:00:29,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:00:29,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 21:00:29,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:29,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485088386] [2025-01-09 21:00:29,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485088386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:29,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:29,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:00:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152111932] [2025-01-09 21:00:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:29,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:00:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:29,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:00:29,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:00:29,361 INFO L87 Difference]: Start difference. First operand 700 states and 983 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:29,766 INFO L93 Difference]: Finished difference Result 1325 states and 1880 transitions. [2025-01-09 21:00:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:00:29,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 112 [2025-01-09 21:00:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:29,768 INFO L225 Difference]: With dead ends: 1325 [2025-01-09 21:00:29,768 INFO L226 Difference]: Without dead ends: 714 [2025-01-09 21:00:29,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:00:29,770 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 9 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:29,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3793 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:00:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-01-09 21:00:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 700. [2025-01-09 21:00:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 672 states have (on average 1.3973214285714286) internal successors, (939), 689 states have internal predecessors, (939), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (23), 7 states have call predecessors, (23), 21 states have call successors, (23) [2025-01-09 21:00:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 983 transitions. [2025-01-09 21:00:29,782 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 983 transitions. Word has length 112 [2025-01-09 21:00:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 983 transitions. [2025-01-09 21:00:29,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 983 transitions. [2025-01-09 21:00:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 21:00:29,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:29,784 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:29,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:00:29,784 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:29,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:29,785 INFO L85 PathProgramCache]: Analyzing trace with hash -972526467, now seen corresponding path program 1 times [2025-01-09 21:00:29,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:29,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085653554] [2025-01-09 21:00:29,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:29,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:00:29,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:00:29,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:29,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 21:00:30,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:30,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085653554] [2025-01-09 21:00:30,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085653554] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:30,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104726591] [2025-01-09 21:00:30,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:30,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:30,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:30,076 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:00:30,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 21:00:30,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:00:30,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:00:30,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:30,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:30,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 21:00:30,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:00:30,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:00:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:00:30,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104726591] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:00:30,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:00:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2025-01-09 21:00:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643611524] [2025-01-09 21:00:30,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:00:30,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:00:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:30,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:00:30,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:00:30,625 INFO L87 Difference]: Start difference. First operand 700 states and 983 transitions. Second operand has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:00:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:31,077 INFO L93 Difference]: Finished difference Result 1301 states and 1848 transitions. [2025-01-09 21:00:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 21:00:31,077 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-01-09 21:00:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:31,080 INFO L225 Difference]: With dead ends: 1301 [2025-01-09 21:00:31,080 INFO L226 Difference]: Without dead ends: 713 [2025-01-09 21:00:31,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 21:00:31,081 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 42 mSDsluCounter, 4733 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 5264 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:31,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 5264 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:00:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-01-09 21:00:31,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 709. [2025-01-09 21:00:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 681 states have (on average 1.3994126284875184) internal successors, (953), 698 states have internal predecessors, (953), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:00:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 996 transitions. [2025-01-09 21:00:31,092 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 996 transitions. Word has length 112 [2025-01-09 21:00:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:31,093 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 996 transitions. [2025-01-09 21:00:31,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 21:00:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 996 transitions. [2025-01-09 21:00:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 21:00:31,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:31,094 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:31,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 21:00:31,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 21:00:31,298 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash 174408191, now seen corresponding path program 2 times [2025-01-09 21:00:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:31,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784168291] [2025-01-09 21:00:31,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:00:31,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:31,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-01-09 21:00:31,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 121 statements. [2025-01-09 21:00:31,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:00:31,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-01-09 21:00:31,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:31,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784168291] [2025-01-09 21:00:31,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784168291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:31,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:31,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:00:31,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889456720] [2025-01-09 21:00:31,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:31,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:00:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:31,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:00:31,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:00:31,740 INFO L87 Difference]: Start difference. First operand 709 states and 996 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:34,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 21:00:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:35,158 INFO L93 Difference]: Finished difference Result 1352 states and 1914 transitions. [2025-01-09 21:00:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:00:35,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 121 [2025-01-09 21:00:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:35,163 INFO L225 Difference]: With dead ends: 1352 [2025-01-09 21:00:35,163 INFO L226 Difference]: Without dead ends: 727 [2025-01-09 21:00:35,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:00:35,164 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 34 mSDsluCounter, 3670 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:35,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4200 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 21:00:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-01-09 21:00:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 711. [2025-01-09 21:00:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 683 states have (on average 1.3953147877013177) internal successors, (953), 700 states have internal predecessors, (953), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:00:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 996 transitions. [2025-01-09 21:00:35,178 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 996 transitions. Word has length 121 [2025-01-09 21:00:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:35,178 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 996 transitions. [2025-01-09 21:00:35,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:35,179 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 996 transitions. [2025-01-09 21:00:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 21:00:35,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:35,179 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:35,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:00:35,180 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:35,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -924070948, now seen corresponding path program 1 times [2025-01-09 21:00:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:35,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306957133] [2025-01-09 21:00:35,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:35,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:00:35,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:00:35,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:35,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 21:00:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:35,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306957133] [2025-01-09 21:00:35,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306957133] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:35,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324948863] [2025-01-09 21:00:35,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:35,633 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:00:35,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 21:00:36,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:00:36,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:00:36,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:36,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:36,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 21:00:36,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 21:00:36,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:00:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 21:00:36,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324948863] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:00:36,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:00:36,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-01-09 21:00:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134688790] [2025-01-09 21:00:36,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:00:36,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 21:00:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:36,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 21:00:36,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2025-01-09 21:00:36,754 INFO L87 Difference]: Start difference. First operand 711 states and 996 transitions. Second operand has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:00:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:37,155 INFO L93 Difference]: Finished difference Result 1318 states and 1865 transitions. [2025-01-09 21:00:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 21:00:37,156 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 121 [2025-01-09 21:00:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:37,158 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 21:00:37,158 INFO L226 Difference]: Without dead ends: 720 [2025-01-09 21:00:37,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=625, Unknown=0, NotChecked=0, Total=992 [2025-01-09 21:00:37,159 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 10 mSDsluCounter, 3242 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3784 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:37,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3784 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:00:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-01-09 21:00:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 718. [2025-01-09 21:00:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 690 states have (on average 1.391304347826087) internal successors, (960), 707 states have internal predecessors, (960), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:00:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1003 transitions. [2025-01-09 21:00:37,171 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1003 transitions. Word has length 121 [2025-01-09 21:00:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:37,171 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1003 transitions. [2025-01-09 21:00:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:00:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1003 transitions. [2025-01-09 21:00:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 21:00:37,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:37,172 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:37,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 21:00:37,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:37,377 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash -210080448, now seen corresponding path program 2 times [2025-01-09 21:00:37,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:37,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671388001] [2025-01-09 21:00:37,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:00:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:37,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-01-09 21:00:37,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 128 statements. [2025-01-09 21:00:37,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:00:37,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-01-09 21:00:37,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:37,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671388001] [2025-01-09 21:00:37,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671388001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:00:37,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:00:37,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:00:37,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066859374] [2025-01-09 21:00:37,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:00:37,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 21:00:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:00:37,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 21:00:37,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:00:37,652 INFO L87 Difference]: Start difference. First operand 718 states and 1003 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:00:37,963 INFO L93 Difference]: Finished difference Result 1383 states and 1950 transitions. [2025-01-09 21:00:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:00:37,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2025-01-09 21:00:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:00:37,965 INFO L225 Difference]: With dead ends: 1383 [2025-01-09 21:00:37,966 INFO L226 Difference]: Without dead ends: 750 [2025-01-09 21:00:37,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 21:00:37,967 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 19 mSDsluCounter, 3319 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3846 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:00:37,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3846 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:00:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-01-09 21:00:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 730. [2025-01-09 21:00:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 702 states have (on average 1.3874643874643875) internal successors, (974), 719 states have internal predecessors, (974), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 21:00:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1017 transitions. [2025-01-09 21:00:37,980 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1017 transitions. Word has length 128 [2025-01-09 21:00:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:00:37,980 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1017 transitions. [2025-01-09 21:00:37,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:00:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1017 transitions. [2025-01-09 21:00:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 21:00:37,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:00:37,981 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:00:37,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:00:37,981 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 21:00:37,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:00:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1593200105, now seen corresponding path program 1 times [2025-01-09 21:00:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:00:37,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814046153] [2025-01-09 21:00:37,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:00:38,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:00:38,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:00:38,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:38,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 223 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 21:00:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:00:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814046153] [2025-01-09 21:00:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814046153] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:00:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198246191] [2025-01-09 21:00:38,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:00:38,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:00:38,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:00:38,711 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-09 21:00:38,712 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-09 21:00:38,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 21:00:39,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 21:00:39,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:00:39,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:00:39,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 201 conjuncts are in the unsatisfiable core [2025-01-09 21:00:39,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:00:39,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-01-09 21:00:39,600 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-01-09 21:00:39,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-01-09 21:00:39,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 21:00:39,614 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 13 treesize of output 9 [2025-01-09 21:00:39,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 21:00:39,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2025-01-09 21:00:40,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 21:00:40,425 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-01-09 21:00:40,428 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 30 treesize of output 13 [2025-01-09 21:01:13,234 INFO L224 Elim1Store]: Index analysis took 803 ms